./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.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.6.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 7334648c93226b30578843a7fb29bf568bbbf46b83ab126a034690ad505a2960 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:55:24,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:55:24,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:55:24,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:55:24,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:55:24,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:55:24,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:55:24,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:55:24,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:55:24,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:55:24,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:55:24,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:55:24,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:55:24,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:55:24,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:55:24,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:55:24,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:55:24,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:55:24,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:55:24,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:55:24,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:55:24,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:55:24,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:55:24,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:55:24,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:55:24,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:55:24,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:55:24,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:55:24,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:55:24,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:55:24,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:55:24,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:55:24,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:55:24,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:55:24,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:55:24,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:55:24,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:55:24,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:55:24,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:55:24,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:55:24,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:55:24,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:55:24,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:55:24,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:55:24,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:55:24,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:55:24,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:55:24,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:55:24,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:55:24,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:55:24,125 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:55:24,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:55:24,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:55:24,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:55:24,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:55:24,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:55:24,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:55:24,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:55:24,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:55:24,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:55:24,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:55:24,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:55:24,129 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:55:24,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:55:24,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:55:24,129 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 -> 7334648c93226b30578843a7fb29bf568bbbf46b83ab126a034690ad505a2960 [2022-02-20 18:55:24,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:55:24,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:55:24,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:55:24,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:55:24,347 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:55:24,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:55:24,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c3c1acb/34b9839a1cce48bd98b63b43d84b7425/FLAG108e54e46 [2022-02-20 18:55:24,718 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:55:24,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:55:24,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c3c1acb/34b9839a1cce48bd98b63b43d84b7425/FLAG108e54e46 [2022-02-20 18:55:25,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c3c1acb/34b9839a1cce48bd98b63b43d84b7425 [2022-02-20 18:55:25,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:55:25,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:55:25,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:55:25,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:55:25,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:55:25,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e994222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25, skipping insertion in model container [2022-02-20 18:55:25,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:55:25,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:55:25,408 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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6730,6743] [2022-02-20 18:55:25,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:55:25,462 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:55:25,547 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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6730,6743] [2022-02-20 18:55:25,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:55:25,590 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:55:25,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25 WrapperNode [2022-02-20 18:55:25,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:55:25,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:55:25,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:55:25,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:55:25,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,637 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 491 [2022-02-20 18:55:25,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:55:25,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:55:25,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:55:25,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:55:25,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:55:25,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:55:25,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:55:25,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:55:25,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (1/1) ... [2022-02-20 18:55:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:55:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:55:25,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:55:25,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:55:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:55:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:55:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:55:25,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:55:25,858 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:55:25,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:55:26,400 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:55:26,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:55:26,409 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:55:26,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:55:26 BoogieIcfgContainer [2022-02-20 18:55:26,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:55:26,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:55:26,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:55:26,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:55:26,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:55:25" (1/3) ... [2022-02-20 18:55:26,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46adf00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:55:26, skipping insertion in model container [2022-02-20 18:55:26,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:55:25" (2/3) ... [2022-02-20 18:55:26,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46adf00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:55:26, skipping insertion in model container [2022-02-20 18:55:26,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:55:26" (3/3) ... [2022-02-20 18:55:26,417 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:55:26,421 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:55:26,421 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:55:26,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:55:26,453 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:55:26,453 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:55:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:55:26,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:26,470 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] [2022-02-20 18:55:26,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1122612567, now seen corresponding path program 1 times [2022-02-20 18:55:26,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:26,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000924068] [2022-02-20 18:55:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:26,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {121#true} is VALID [2022-02-20 18:55:26,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {121#true} is VALID [2022-02-20 18:55:26,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#true} assume 0 == ~r1~0 % 256; {121#true} is VALID [2022-02-20 18:55:26,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#true} assume ~id1~0 >= 0; {121#true} is VALID [2022-02-20 18:55:26,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#true} assume 0 == ~st1~0; {121#true} is VALID [2022-02-20 18:55:26,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {121#true} assume ~send1~0 == ~id1~0; {121#true} is VALID [2022-02-20 18:55:26,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {121#true} assume 0 == ~mode1~0 % 256; {121#true} is VALID [2022-02-20 18:55:26,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#true} assume ~id2~0 >= 0; {121#true} is VALID [2022-02-20 18:55:26,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#true} assume 0 == ~st2~0; {121#true} is VALID [2022-02-20 18:55:26,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#true} assume ~send2~0 == ~id2~0; {121#true} is VALID [2022-02-20 18:55:26,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#true} assume 0 == ~mode2~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {123#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {123#(= (+ (* (- 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; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:55:26,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {123#(= (+ (* (- 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; {122#false} is VALID [2022-02-20 18:55:26,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {122#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:55:26,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {122#false} ~mode2~0 := 0; {122#false} is VALID [2022-02-20 18:55:26,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {122#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {122#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {122#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:55:26,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {122#false} ~mode3~0 := 0; {122#false} is VALID [2022-02-20 18:55:26,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {122#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {122#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {122#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:55:26,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {122#false} ~mode4~0 := 0; {122#false} is VALID [2022-02-20 18:55:26,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {122#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {122#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {122#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:55:26,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {122#false} ~mode5~0 := 0; {122#false} is VALID [2022-02-20 18:55:26,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {122#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {122#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:55:26,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {122#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:55:26,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {122#false} ~mode6~0 := 0; {122#false} is VALID [2022-02-20 18:55:26,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {122#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;havoc main_~check__tmp~0#1; {122#false} is VALID [2022-02-20 18:55:26,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {122#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {122#false} is VALID [2022-02-20 18:55:26,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {122#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {122#false} is VALID [2022-02-20 18:55:26,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {122#false} assume 0 == main_~assert__arg~0#1 % 256; {122#false} is VALID [2022-02-20 18:55:26,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {122#false} assume !false; {122#false} is VALID [2022-02-20 18:55:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:26,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:26,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000924068] [2022-02-20 18:55:26,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000924068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:26,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:26,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:26,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392961739] [2022-02-20 18:55:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:26,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:55:26,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:26,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:26,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:26,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:26,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:26,927 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 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 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:27,288 INFO L93 Difference]: Finished difference Result 260 states and 422 transitions. [2022-02-20 18:55:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:55:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-02-20 18:55:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-02-20 18:55:27,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 422 transitions. [2022-02-20 18:55:27,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:27,619 INFO L225 Difference]: With dead ends: 260 [2022-02-20 18:55:27,619 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 18:55:27,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:27,626 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:27,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 403 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 18:55:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-02-20 18:55:27,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:27,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,684 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,685 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:27,692 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2022-02-20 18:55:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2022-02-20 18:55:27,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:27,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:27,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 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 179 states. [2022-02-20 18:55:27,694 INFO L87 Difference]: Start difference. First operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 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 179 states. [2022-02-20 18:55:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:27,699 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2022-02-20 18:55:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2022-02-20 18:55:27,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:27,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:27,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:27,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2022-02-20 18:55:27,709 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 73 [2022-02-20 18:55:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:27,710 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2022-02-20 18:55:27,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2022-02-20 18:55:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:55:27,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:27,712 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] [2022-02-20 18:55:27,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:55:27,713 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1622464055, now seen corresponding path program 1 times [2022-02-20 18:55:27,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:27,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723389897] [2022-02-20 18:55:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:27,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {1058#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {1058#true} is VALID [2022-02-20 18:55:27,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1058#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {1058#true} is VALID [2022-02-20 18:55:27,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#true} assume 0 == ~r1~0 % 256; {1058#true} is VALID [2022-02-20 18:55:27,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#true} assume ~id1~0 >= 0; {1058#true} is VALID [2022-02-20 18:55:27,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~st1~0; {1058#true} is VALID [2022-02-20 18:55:27,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#true} assume ~send1~0 == ~id1~0; {1058#true} is VALID [2022-02-20 18:55:27,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#true} assume 0 == ~mode1~0 % 256; {1058#true} is VALID [2022-02-20 18:55:27,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {1058#true} assume ~id2~0 >= 0; {1058#true} is VALID [2022-02-20 18:55:27,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {1058#true} assume 0 == ~st2~0; {1058#true} is VALID [2022-02-20 18:55:27,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#true} assume ~send2~0 == ~id2~0; {1058#true} is VALID [2022-02-20 18:55:27,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#true} assume 0 == ~mode2~0 % 256; {1058#true} is VALID [2022-02-20 18:55:27,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1058#true} assume ~id3~0 >= 0; {1058#true} is VALID [2022-02-20 18:55:27,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1058#true} assume 0 == ~st3~0; {1058#true} is VALID [2022-02-20 18:55:27,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#true} assume ~send3~0 == ~id3~0; {1058#true} is VALID [2022-02-20 18:55:27,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#true} assume 0 == ~mode3~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {1060#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {1060#(= (+ (* (- 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; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {1060#(= (+ (* (- 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; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {1060#(= (+ (* (- 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; {1059#false} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {1059#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {1059#false} ~mode3~0 := 0; {1059#false} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {1059#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {1059#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {1059#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {1059#false} ~mode4~0 := 0; {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {1059#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {1059#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {1059#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {1059#false} ~mode5~0 := 0; {1059#false} is VALID [2022-02-20 18:55:27,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {1059#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {1059#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {1059#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {1059#false} ~mode6~0 := 0; {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {1059#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;havoc main_~check__tmp~0#1; {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {1059#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {1059#false} is VALID [2022-02-20 18:55:27,837 INFO L290 TraceCheckUtils]: 71: Hoare triple {1059#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {1059#false} is VALID [2022-02-20 18:55:27,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {1059#false} assume 0 == main_~assert__arg~0#1 % 256; {1059#false} is VALID [2022-02-20 18:55:27,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2022-02-20 18:55:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:27,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:27,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723389897] [2022-02-20 18:55:27,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723389897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:27,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:27,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:27,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369927988] [2022-02-20 18:55:27,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:55:27,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:27,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:27,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:27,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:27,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:27,889 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:28,101 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2022-02-20 18:55:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:55:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:28,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:55:28,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:28,345 INFO L225 Difference]: With dead ends: 429 [2022-02-20 18:55:28,345 INFO L226 Difference]: Without dead ends: 295 [2022-02-20 18:55:28,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:28,346 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 94 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:28,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-02-20 18:55:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-02-20 18:55:28,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:28,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,361 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,362 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:28,368 INFO L93 Difference]: Finished difference Result 295 states and 441 transitions. [2022-02-20 18:55:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 441 transitions. [2022-02-20 18:55:28,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:28,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:28,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:55:28,370 INFO L87 Difference]: Start difference. First operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:55:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:28,376 INFO L93 Difference]: Finished difference Result 295 states and 441 transitions. [2022-02-20 18:55:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 441 transitions. [2022-02-20 18:55:28,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:28,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:28,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:28,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 440 transitions. [2022-02-20 18:55:28,384 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 440 transitions. Word has length 74 [2022-02-20 18:55:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:28,385 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 440 transitions. [2022-02-20 18:55:28,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 440 transitions. [2022-02-20 18:55:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:55:28,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:28,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:55:28,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:55:28,387 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 549627260, now seen corresponding path program 1 times [2022-02-20 18:55:28,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:28,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032785172] [2022-02-20 18:55:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:28,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {2628#true} is VALID [2022-02-20 18:55:28,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {2628#true} is VALID [2022-02-20 18:55:28,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume 0 == ~r1~0 % 256; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {2628#true} assume ~id1~0 >= 0; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {2628#true} assume 0 == ~st1~0; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {2628#true} assume ~send1~0 == ~id1~0; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {2628#true} assume 0 == ~mode1~0 % 256; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {2628#true} assume ~id2~0 >= 0; {2628#true} is VALID [2022-02-20 18:55:28,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#true} assume 0 == ~st2~0; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#true} assume ~send2~0 == ~id2~0; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {2628#true} assume 0 == ~mode2~0 % 256; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {2628#true} assume ~id3~0 >= 0; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {2628#true} assume 0 == ~st3~0; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2628#true} assume ~send3~0 == ~id3~0; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {2628#true} assume 0 == ~mode3~0 % 256; {2628#true} is VALID [2022-02-20 18:55:28,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {2628#true} assume ~id4~0 >= 0; {2628#true} is VALID [2022-02-20 18:55:28,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {2628#true} assume 0 == ~st4~0; {2628#true} is VALID [2022-02-20 18:55:28,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {2628#true} assume ~send4~0 == ~id4~0; {2628#true} is VALID [2022-02-20 18:55:28,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#true} assume 0 == ~mode4~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {2630#(= (+ (* (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;main_~main__i2~0#1 := 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {2630#(= (+ (* (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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {2630#(= (+ (* (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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {2630#(= (+ (* (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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:55:28,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {2630#(= (+ (* (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; {2629#false} is VALID [2022-02-20 18:55:28,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {2629#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {2629#false} ~mode4~0 := 0; {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {2629#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {2629#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 64: Hoare triple {2629#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {2629#false} ~mode5~0 := 0; {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {2629#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:55:28,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {2629#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {2629#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {2629#false} ~mode6~0 := 0; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {2629#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;havoc main_~check__tmp~0#1; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {2629#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {2629#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {2629#false} assume 0 == main_~assert__arg~0#1 % 256; {2629#false} is VALID [2022-02-20 18:55:28,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2022-02-20 18:55:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:28,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:28,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032785172] [2022-02-20 18:55:28,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032785172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:28,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:28,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:28,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881495568] [2022-02-20 18:55:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:28,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:55:28,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:28,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:28,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:28,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:28,551 INFO L87 Difference]: Start difference. First operand 293 states and 440 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:28,759 INFO L93 Difference]: Finished difference Result 761 states and 1182 transitions. [2022-02-20 18:55:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-20 18:55:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:28,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:55:28,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:28,972 INFO L225 Difference]: With dead ends: 761 [2022-02-20 18:55:28,972 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:55:28,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:28,992 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:28,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:55:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 509. [2022-02-20 18:55:29,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:29,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,034 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,035 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:29,048 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2022-02-20 18:55:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 781 transitions. [2022-02-20 18:55:29,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:29,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:29,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 511 states. [2022-02-20 18:55:29,050 INFO L87 Difference]: Start difference. First operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 511 states. [2022-02-20 18:55:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:29,063 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2022-02-20 18:55:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 781 transitions. [2022-02-20 18:55:29,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:29,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:29,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:29,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 780 transitions. [2022-02-20 18:55:29,078 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 780 transitions. Word has length 75 [2022-02-20 18:55:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:29,078 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 780 transitions. [2022-02-20 18:55:29,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 780 transitions. [2022-02-20 18:55:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:55:29,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:29,079 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] [2022-02-20 18:55:29,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:55:29,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1347673334, now seen corresponding path program 1 times [2022-02-20 18:55:29,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:29,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647481828] [2022-02-20 18:55:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:29,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {5401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {5401#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {5401#true} assume 0 == ~r1~0 % 256; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {5401#true} assume ~id1~0 >= 0; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {5401#true} assume 0 == ~st1~0; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {5401#true} assume ~send1~0 == ~id1~0; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {5401#true} assume 0 == ~mode1~0 % 256; {5401#true} is VALID [2022-02-20 18:55:29,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {5401#true} assume ~id2~0 >= 0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {5401#true} assume 0 == ~st2~0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {5401#true} assume ~send2~0 == ~id2~0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {5401#true} assume 0 == ~mode2~0 % 256; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {5401#true} assume ~id3~0 >= 0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {5401#true} assume 0 == ~st3~0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {5401#true} assume ~send3~0 == ~id3~0; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {5401#true} assume 0 == ~mode3~0 % 256; {5401#true} is VALID [2022-02-20 18:55:29,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5401#true} assume ~id4~0 >= 0; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {5401#true} assume 0 == ~st4~0; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {5401#true} assume ~send4~0 == ~id4~0; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {5401#true} assume 0 == ~mode4~0 % 256; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {5401#true} assume ~id5~0 >= 0; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5401#true} assume 0 == ~st5~0; {5401#true} is VALID [2022-02-20 18:55:29,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {5401#true} assume ~send5~0 == ~id5~0; {5401#true} is VALID [2022-02-20 18:55:29,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5401#true} assume 0 == ~mode5~0 % 256; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {5403#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {5403#(= (+ (* (- 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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {5403#(= (+ (* (- 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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {5403#(= (+ (* (- 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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {5403#(= (+ (* (- 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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:55:29,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {5403#(= (+ (* (- 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; {5402#false} is VALID [2022-02-20 18:55:29,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {5402#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {5402#false} is VALID [2022-02-20 18:55:29,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {5402#false} ~mode5~0 := 0; {5402#false} is VALID [2022-02-20 18:55:29,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {5402#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {5402#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {5402#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {5402#false} ~mode6~0 := 0; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {5402#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;havoc main_~check__tmp~0#1; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 72: Hoare triple {5402#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {5402#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 74: Hoare triple {5402#false} assume 0 == main_~assert__arg~0#1 % 256; {5402#false} is VALID [2022-02-20 18:55:29,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {5402#false} assume !false; {5402#false} is VALID [2022-02-20 18:55:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:29,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:29,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647481828] [2022-02-20 18:55:29,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647481828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:29,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:29,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:29,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474539730] [2022-02-20 18:55:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:55:29,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:29,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:29,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:29,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:29,219 INFO L87 Difference]: Start difference. First operand 509 states and 780 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:29,486 INFO L93 Difference]: Finished difference Result 1377 states and 2150 transitions. [2022-02-20 18:55:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:29,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:55:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:29,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:55:29,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:29,768 INFO L225 Difference]: With dead ends: 1377 [2022-02-20 18:55:29,768 INFO L226 Difference]: Without dead ends: 911 [2022-02-20 18:55:29,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:29,769 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:29,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-02-20 18:55:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 909. [2022-02-20 18:55:29,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:29,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,820 INFO L74 IsIncluded]: Start isIncluded. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,821 INFO L87 Difference]: Start difference. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:29,855 INFO L93 Difference]: Finished difference Result 911 states and 1405 transitions. [2022-02-20 18:55:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1405 transitions. [2022-02-20 18:55:29,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:29,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:29,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 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 911 states. [2022-02-20 18:55:29,861 INFO L87 Difference]: Start difference. First operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 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 911 states. [2022-02-20 18:55:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:29,890 INFO L93 Difference]: Finished difference Result 911 states and 1405 transitions. [2022-02-20 18:55:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1405 transitions. [2022-02-20 18:55:29,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:29,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:29,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:29,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1404 transitions. [2022-02-20 18:55:29,938 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1404 transitions. Word has length 76 [2022-02-20 18:55:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:29,939 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1404 transitions. [2022-02-20 18:55:29,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1404 transitions. [2022-02-20 18:55:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:55:29,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:29,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:55:29,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:55:29,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1762980839, now seen corresponding path program 1 times [2022-02-20 18:55:29,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:29,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124062519] [2022-02-20 18:55:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:30,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {10406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {10406#true} is VALID [2022-02-20 18:55:30,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {10406#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {10406#true} is VALID [2022-02-20 18:55:30,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {10406#true} assume 0 == ~r1~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {10406#true} assume ~id1~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {10406#true} assume 0 == ~st1~0; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {10406#true} assume ~send1~0 == ~id1~0; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {10406#true} assume 0 == ~mode1~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {10406#true} assume ~id2~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {10406#true} assume 0 == ~st2~0; {10406#true} is VALID [2022-02-20 18:55:30,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {10406#true} assume ~send2~0 == ~id2~0; {10406#true} is VALID [2022-02-20 18:55:30,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {10406#true} assume 0 == ~mode2~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {10406#true} assume ~id3~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {10406#true} assume 0 == ~st3~0; {10406#true} is VALID [2022-02-20 18:55:30,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {10406#true} assume ~send3~0 == ~id3~0; {10406#true} is VALID [2022-02-20 18:55:30,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {10406#true} assume 0 == ~mode3~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {10406#true} assume ~id4~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {10406#true} assume 0 == ~st4~0; {10406#true} is VALID [2022-02-20 18:55:30,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {10406#true} assume ~send4~0 == ~id4~0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {10406#true} assume 0 == ~mode4~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {10406#true} assume ~id5~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {10406#true} assume 0 == ~st5~0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {10406#true} assume ~send5~0 == ~id5~0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {10406#true} assume 0 == ~mode5~0 % 256; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {10406#true} assume ~id6~0 >= 0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {10406#true} assume 0 == ~st6~0; {10406#true} is VALID [2022-02-20 18:55:30,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {10406#true} assume ~send6~0 == ~id6~0; {10406#true} is VALID [2022-02-20 18:55:30,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {10406#true} assume 0 == ~mode6~0 % 256; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {10408#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {10408#(= (+ (* (- 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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {10408#(= (+ (* (- 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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,046 INFO L290 TraceCheckUtils]: 53: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {10408#(= (+ (* (- 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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,048 INFO L290 TraceCheckUtils]: 60: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {10408#(= (+ (* (- 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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {10408#(= (+ (* (- 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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:55:30,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {10408#(= (+ (* (- 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; {10407#false} is VALID [2022-02-20 18:55:30,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {10407#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {10407#false} is VALID [2022-02-20 18:55:30,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {10407#false} ~mode6~0 := 0; {10407#false} is VALID [2022-02-20 18:55:30,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {10407#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;havoc main_~check__tmp~0#1; {10407#false} is VALID [2022-02-20 18:55:30,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {10407#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {10407#false} is VALID [2022-02-20 18:55:30,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {10407#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {10407#false} is VALID [2022-02-20 18:55:30,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {10407#false} assume 0 == main_~assert__arg~0#1 % 256; {10407#false} is VALID [2022-02-20 18:55:30,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {10407#false} assume !false; {10407#false} is VALID [2022-02-20 18:55:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:30,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:30,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124062519] [2022-02-20 18:55:30,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124062519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:30,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:30,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:55:30,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187151863] [2022-02-20 18:55:30,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 18:55:30,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:30,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:30,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:30,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:55:30,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:55:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:30,102 INFO L87 Difference]: Start difference. First operand 909 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:30,661 INFO L93 Difference]: Finished difference Result 2513 states and 3918 transitions. [2022-02-20 18:55:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-20 18:55:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:55:30,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:55:30,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:31,008 INFO L225 Difference]: With dead ends: 2513 [2022-02-20 18:55:31,008 INFO L226 Difference]: Without dead ends: 1647 [2022-02-20 18:55:31,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:55:31,010 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:31,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-02-20 18:55:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2022-02-20 18:55:31,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:31,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,077 INFO L74 IsIncluded]: Start isIncluded. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,080 INFO L87 Difference]: Start difference. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:31,157 INFO L93 Difference]: Finished difference Result 1647 states and 2541 transitions. [2022-02-20 18:55:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2541 transitions. [2022-02-20 18:55:31,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:31,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:31,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 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 1647 states. [2022-02-20 18:55:31,163 INFO L87 Difference]: Start difference. First operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 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 1647 states. [2022-02-20 18:55:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:31,277 INFO L93 Difference]: Finished difference Result 1647 states and 2541 transitions. [2022-02-20 18:55:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2541 transitions. [2022-02-20 18:55:31,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:31,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:31,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:31,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2540 transitions. [2022-02-20 18:55:31,399 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2540 transitions. Word has length 77 [2022-02-20 18:55:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:31,399 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2540 transitions. [2022-02-20 18:55:31,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2540 transitions. [2022-02-20 18:55:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:55:31,400 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:31,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:55:31,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:55:31,400 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1296361934, now seen corresponding path program 1 times [2022-02-20 18:55:31,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:31,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446170886] [2022-02-20 18:55:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:31,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:31,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {19527#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {19527#true} is VALID [2022-02-20 18:55:31,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {19527#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {19527#true} is VALID [2022-02-20 18:55:31,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {19527#true} assume 0 == ~r1~0 % 256; {19527#true} is VALID [2022-02-20 18:55:31,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {19527#true} assume ~id1~0 >= 0; {19527#true} is VALID [2022-02-20 18:55:31,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {19527#true} assume 0 == ~st1~0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:31,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {19529#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:31,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {19529#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:31,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {19529#(<= ~st1~0 0)} assume ~id2~0 >= 0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:31,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {19529#(<= ~st1~0 0)} assume 0 == ~st2~0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:31,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,516 INFO L290 TraceCheckUtils]: 54: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,520 INFO L290 TraceCheckUtils]: 66: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,520 INFO L290 TraceCheckUtils]: 67: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,521 INFO L290 TraceCheckUtils]: 69: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p6_new~0 == ~nomsg~0;main_~node6____CPAchecker_TMP_0~0#1 := ~send6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;havoc main_~check__tmp~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:31,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {19528#false} is VALID [2022-02-20 18:55:31,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {19528#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {19528#false} is VALID [2022-02-20 18:55:31,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {19528#false} assume 0 == main_~assert__arg~0#1 % 256; {19528#false} is VALID [2022-02-20 18:55:31,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {19528#false} assume !false; {19528#false} is VALID [2022-02-20 18:55:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:55:31,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:31,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446170886] [2022-02-20 18:55:31,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446170886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:31,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:31,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:55:31,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645774393] [2022-02-20 18:55:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:31,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:55:31,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:31,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:31,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:31,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:55:31,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:31,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:55:31,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:55:31,561 INFO L87 Difference]: Start difference. First operand 1645 states and 2540 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:00,098 INFO L93 Difference]: Finished difference Result 20869 states and 32504 transitions. [2022-02-20 18:56:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:56:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-20 18:56:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-02-20 18:56:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-02-20 18:56:00,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 1525 transitions. [2022-02-20 18:56:00,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1525 edges. 1525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:15,560 INFO L225 Difference]: With dead ends: 20869 [2022-02-20 18:56:15,561 INFO L226 Difference]: Without dead ends: 19267 [2022-02-20 18:56:15,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:56:15,567 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 1770 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:15,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1770 Valid, 2903 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:56:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19267 states. [2022-02-20 18:56:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19267 to 3245. [2022-02-20 18:56:19,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:19,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:19,465 INFO L74 IsIncluded]: Start isIncluded. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:19,475 INFO L87 Difference]: Start difference. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:29,049 INFO L93 Difference]: Finished difference Result 19267 states and 29623 transitions. [2022-02-20 18:56:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19267 states and 29623 transitions. [2022-02-20 18:56:29,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:29,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:29,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 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 19267 states. [2022-02-20 18:56:29,079 INFO L87 Difference]: Start difference. First operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 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 19267 states. [2022-02-20 18:56:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:38,819 INFO L93 Difference]: Finished difference Result 19267 states and 29623 transitions. [2022-02-20 18:56:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19267 states and 29623 transitions. [2022-02-20 18:56:38,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:38,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:38,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:38,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call 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:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 4972 transitions. [2022-02-20 18:56:39,268 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 4972 transitions. Word has length 78 [2022-02-20 18:56:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:39,268 INFO L470 AbstractCegarLoop]: Abstraction has 3245 states and 4972 transitions. [2022-02-20 18:56:39,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 4972 transitions. [2022-02-20 18:56:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:56:39,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:39,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:39,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:56:39,269 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1185122290, now seen corresponding path program 1 times [2022-02-20 18:56:39,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:39,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381987026] [2022-02-20 18:56:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:39,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {92044#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~__return_13172~0 := 0;~__return_13305~0 := 0; {92044#true} is VALID [2022-02-20 18:56:39,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {92044#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~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;havoc main_~init__tmp~0#1; {92044#true} is VALID [2022-02-20 18:56:39,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {92044#true} assume 0 == ~r1~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id6~0 >= 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 == ~id6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode6~0 % 256; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13172~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13172~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;main_~main__i2~0#1 := 0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~nomsg~0); {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0); {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send4~0 != ~nomsg~0); {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send5~0 != ~nomsg~0); {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,376 INFO L290 TraceCheckUtils]: 70: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 != ~nomsg~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p6_new~0 == ~nomsg~0;main_~node6____CPAchecker_TMP_0~0#1 := ~send6~0; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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;havoc main_~check__tmp~0#1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {92046#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 6; {92045#false} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {92045#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1; {92045#false} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {92045#false} ~__return_13305~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13305~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; {92045#false} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {92045#false} assume 0 == main_~assert__arg~0#1 % 256; {92045#false} is VALID [2022-02-20 18:56:39,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {92045#false} assume !false; {92045#false} is VALID [2022-02-20 18:56:39,379 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:39,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:39,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381987026] [2022-02-20 18:56:39,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381987026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:39,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:39,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:39,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415645] [2022-02-20 18:56:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-20 18:56:39,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:39,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:39,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:39,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:39,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:39,439 INFO L87 Difference]: Start difference. First operand 3245 states and 4972 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)