./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.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-var-start-time.6.2.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 f3302497ea925232664f79330834ccdc9bbd9e62586cb93dfb7cf8f1101390c2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:29,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:29,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:29,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:29,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:29,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:29,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:29,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:29,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:29,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:29,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:29,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:29,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:29,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:29,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:29,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:29,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:29,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:29,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:29,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:29,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:29,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:29,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:29,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:29,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:29,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:29,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:29,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:29,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:29,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:29,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:29,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:29,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:29,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:29,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:29,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:29,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:29,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:29,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:29,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:29,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:29,229 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:49:29,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:29,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:29,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:29,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:29,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:29,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:29,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:29,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:29,253 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:29,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:29,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:29,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:29,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:29,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:29,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:29,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:29,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:29,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:29,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:29,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:29,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:29,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:29,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:29,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:29,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:29,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:29,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:29,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:29,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:29,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:29,258 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:29,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:29,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:29,258 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 -> f3302497ea925232664f79330834ccdc9bbd9e62586cb93dfb7cf8f1101390c2 [2022-02-20 18:49:29,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:29,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:29,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:29,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:29,472 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:29,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:29,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca24470f/9e3a7aa12ec54c7b8e5865511bdf5b88/FLAGa1f7af9ea [2022-02-20 18:49:29,863 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:29,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:29,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca24470f/9e3a7aa12ec54c7b8e5865511bdf5b88/FLAGa1f7af9ea [2022-02-20 18:49:30,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca24470f/9e3a7aa12ec54c7b8e5865511bdf5b88 [2022-02-20 18:49:30,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:30,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:30,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:30,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:30,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:30,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f7bf9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30, skipping insertion in model container [2022-02-20 18:49:30,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:30,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:30,481 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-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2022-02-20 18:49:30,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:30,522 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:30,550 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-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2022-02-20 18:49:30,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:30,578 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:30,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30 WrapperNode [2022-02-20 18:49:30,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:30,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:30,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:30,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:30,595 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:49:30" (1/1) ... [2022-02-20 18:49:30,614 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:49:30" (1/1) ... [2022-02-20 18:49:30,664 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 607 [2022-02-20 18:49:30,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:30,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:30,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:30,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:30,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:30,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:30,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:30,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:30,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (1/1) ... [2022-02-20 18:49:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:30,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:30,728 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:49:30,747 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:49:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:30,837 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:30,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:31,308 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:31,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:31,315 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:31,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:31 BoogieIcfgContainer [2022-02-20 18:49:31,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:31,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:31,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:31,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:31,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:30" (1/3) ... [2022-02-20 18:49:31,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e47810e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:31, skipping insertion in model container [2022-02-20 18:49:31,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:30" (2/3) ... [2022-02-20 18:49:31,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e47810e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:31, skipping insertion in model container [2022-02-20 18:49:31,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:31" (3/3) ... [2022-02-20 18:49:31,322 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:31,326 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:31,327 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:31,366 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:31,370 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:49:31,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7025316455696202) internal successors, (269), 159 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:49:31,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:31,416 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:49:31,416 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -539705947, now seen corresponding path program 1 times [2022-02-20 18:49:31,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:31,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379586928] [2022-02-20 18:49:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:31,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {163#true} is VALID [2022-02-20 18:49:31,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {163#true} is VALID [2022-02-20 18:49:31,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume 0 == ~r1~0 % 256; {163#true} is VALID [2022-02-20 18:49:31,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {163#true} is VALID [2022-02-20 18:49:31,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#true} assume ~id1~0 >= 0; {163#true} is VALID [2022-02-20 18:49:31,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} assume 0 == ~st1~0; {163#true} is VALID [2022-02-20 18:49:31,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume ~send1~0 == ~id1~0; {163#true} is VALID [2022-02-20 18:49:31,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume 0 == ~mode1~0 % 256; {163#true} is VALID [2022-02-20 18:49:31,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#true} assume ~id2~0 >= 0; {163#true} is VALID [2022-02-20 18:49:31,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#true} assume 0 == ~st2~0; {163#true} is VALID [2022-02-20 18:49:31,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#true} assume ~send2~0 == ~id2~0; {163#true} is VALID [2022-02-20 18:49:31,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#true} assume 0 == ~mode2~0 % 256; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {165#(= (+ (* (- 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; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {165#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:31,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {165#(= (+ (* (- 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; {164#false} is VALID [2022-02-20 18:49:31,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {164#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {164#false} is VALID [2022-02-20 18:49:31,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {164#false} ~mode2~0 := 0; {164#false} is VALID [2022-02-20 18:49:31,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {164#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {164#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {164#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {164#false} is VALID [2022-02-20 18:49:31,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {164#false} ~mode3~0 := 0; {164#false} is VALID [2022-02-20 18:49:31,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {164#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {164#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {164#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {164#false} is VALID [2022-02-20 18:49:31,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {164#false} ~mode4~0 := 0; {164#false} is VALID [2022-02-20 18:49:31,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {164#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {164#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {164#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {164#false} is VALID [2022-02-20 18:49:31,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {164#false} ~mode5~0 := 0; {164#false} is VALID [2022-02-20 18:49:31,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {164#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {164#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {164#false} is VALID [2022-02-20 18:49:31,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {164#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {164#false} is VALID [2022-02-20 18:49:31,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {164#false} ~mode6~0 := 0; {164#false} is VALID [2022-02-20 18:49:31,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {164#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; {164#false} is VALID [2022-02-20 18:49:31,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {164#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {164#false} is VALID [2022-02-20 18:49:31,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {164#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {164#false} is VALID [2022-02-20 18:49:31,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {164#false} assume 0 == main_~assert__arg~0#1 % 256; {164#false} is VALID [2022-02-20 18:49:31,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-02-20 18:49:31,773 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:49:31,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:31,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379586928] [2022-02-20 18:49:31,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379586928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:31,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:31,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:31,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040644403] [2022-02-20 18:49:31,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:31,780 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:49:31,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:31,783 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:49:31,840 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:49:31,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:31,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:31,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:31,857 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7025316455696202) internal successors, (269), 159 states have internal predecessors, (269), 0 states have call successors, (0), 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:49:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,282 INFO L93 Difference]: Finished difference Result 376 states and 609 transitions. [2022-02-20 18:49:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:32,283 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:49:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:32,284 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:49:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2022-02-20 18:49:32,293 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:49:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2022-02-20 18:49:32,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 609 transitions. [2022-02-20 18:49:32,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:32,736 INFO L225 Difference]: With dead ends: 376 [2022-02-20 18:49:32,737 INFO L226 Difference]: Without dead ends: 254 [2022-02-20 18:49:32,739 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:49:32,741 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 198 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 576 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:49:32,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 576 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-20 18:49:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-02-20 18:49:32,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:32,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,772 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,773 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,783 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2022-02-20 18:49:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2022-02-20 18:49:32,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:32,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:32,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 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 254 states. [2022-02-20 18:49:32,785 INFO L87 Difference]: Start difference. First operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 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 254 states. [2022-02-20 18:49:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,792 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2022-02-20 18:49:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2022-02-20 18:49:32,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:32,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:32,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:32,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2022-02-20 18:49:32,803 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 73 [2022-02-20 18:49:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:32,803 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2022-02-20 18:49:32,803 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:49:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2022-02-20 18:49:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:49:32,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:32,805 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:49:32,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:32,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1913065188, now seen corresponding path program 1 times [2022-02-20 18:49:32,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:32,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387345573] [2022-02-20 18:49:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:32,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {1510#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {1510#true} is VALID [2022-02-20 18:49:32,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {1510#true} is VALID [2022-02-20 18:49:32,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1510#true} assume 0 == ~r1~0 % 256; {1510#true} is VALID [2022-02-20 18:49:32,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {1510#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1510#true} is VALID [2022-02-20 18:49:32,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {1510#true} assume ~id1~0 >= 0; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1510#true} assume 0 == ~st1~0; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {1510#true} assume ~send1~0 == ~id1~0; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1510#true} assume 0 == ~mode1~0 % 256; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1510#true} assume ~id2~0 >= 0; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {1510#true} assume 0 == ~st2~0; {1510#true} is VALID [2022-02-20 18:49:32,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1510#true} assume ~send2~0 == ~id2~0; {1510#true} is VALID [2022-02-20 18:49:32,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#true} assume 0 == ~mode2~0 % 256; {1510#true} is VALID [2022-02-20 18:49:32,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {1510#true} assume ~id3~0 >= 0; {1510#true} is VALID [2022-02-20 18:49:32,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1510#true} assume 0 == ~st3~0; {1510#true} is VALID [2022-02-20 18:49:32,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1510#true} assume ~send3~0 == ~id3~0; {1510#true} is VALID [2022-02-20 18:49:32,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1510#true} assume 0 == ~mode3~0 % 256; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {1512#(= (+ (* (- 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; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,909 INFO L290 TraceCheckUtils]: 50: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1512#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:32,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {1512#(= (+ (* (- 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; {1511#false} is VALID [2022-02-20 18:49:32,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {1511#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1511#false} is VALID [2022-02-20 18:49:32,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {1511#false} ~mode3~0 := 0; {1511#false} is VALID [2022-02-20 18:49:32,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {1511#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {1511#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,912 INFO L290 TraceCheckUtils]: 59: Hoare triple {1511#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1511#false} is VALID [2022-02-20 18:49:32,912 INFO L290 TraceCheckUtils]: 60: Hoare triple {1511#false} ~mode4~0 := 0; {1511#false} is VALID [2022-02-20 18:49:32,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {1511#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {1511#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {1511#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {1511#false} ~mode5~0 := 0; {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {1511#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {1511#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {1511#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1511#false} is VALID [2022-02-20 18:49:32,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {1511#false} ~mode6~0 := 0; {1511#false} is VALID [2022-02-20 18:49:32,914 INFO L290 TraceCheckUtils]: 69: Hoare triple {1511#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; {1511#false} is VALID [2022-02-20 18:49:32,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {1511#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {1511#false} is VALID [2022-02-20 18:49:32,914 INFO L290 TraceCheckUtils]: 71: Hoare triple {1511#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {1511#false} is VALID [2022-02-20 18:49:32,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {1511#false} assume 0 == main_~assert__arg~0#1 % 256; {1511#false} is VALID [2022-02-20 18:49:32,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {1511#false} assume !false; {1511#false} is VALID [2022-02-20 18:49:32,929 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:49:32,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:32,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387345573] [2022-02-20 18:49:32,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387345573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:32,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:32,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:32,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775488798] [2022-02-20 18:49:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:32,932 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:49:32,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:32,932 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:49:32,977 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:49:32,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:32,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:32,978 INFO L87 Difference]: Start difference. First operand 252 states and 376 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:49:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:33,264 INFO L93 Difference]: Finished difference Result 636 states and 988 transitions. [2022-02-20 18:49:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:33,265 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:49:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:33,265 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:49:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:33,268 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:49:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:33,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 558 transitions. [2022-02-20 18:49:33,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:33,604 INFO L225 Difference]: With dead ends: 636 [2022-02-20 18:49:33,605 INFO L226 Difference]: Without dead ends: 428 [2022-02-20 18:49:33,605 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:49:33,606 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 159 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 504 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:49:33,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 504 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-20 18:49:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2022-02-20 18:49:33,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:33,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:33,638 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:33,638 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:33,649 INFO L93 Difference]: Finished difference Result 428 states and 654 transitions. [2022-02-20 18:49:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 654 transitions. [2022-02-20 18:49:33,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:33,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:33,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 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 428 states. [2022-02-20 18:49:33,652 INFO L87 Difference]: Start difference. First operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 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 428 states. [2022-02-20 18:49:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:33,663 INFO L93 Difference]: Finished difference Result 428 states and 654 transitions. [2022-02-20 18:49:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 654 transitions. [2022-02-20 18:49:33,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:33,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:33,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:33,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.536470588235294) internal successors, (653), 425 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 653 transitions. [2022-02-20 18:49:33,676 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 653 transitions. Word has length 74 [2022-02-20 18:49:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:33,676 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 653 transitions. [2022-02-20 18:49:33,676 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:49:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 653 transitions. [2022-02-20 18:49:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:49:33,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:33,677 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:49:33,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:33,678 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:33,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1816530126, now seen corresponding path program 1 times [2022-02-20 18:49:33,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:33,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536058234] [2022-02-20 18:49:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:33,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:33,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {3809#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {3809#true} is VALID [2022-02-20 18:49:33,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {3809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {3809#true} is VALID [2022-02-20 18:49:33,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {3809#true} assume 0 == ~r1~0 % 256; {3809#true} is VALID [2022-02-20 18:49:33,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {3809#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {3809#true} is VALID [2022-02-20 18:49:33,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {3809#true} assume ~id1~0 >= 0; {3809#true} is VALID [2022-02-20 18:49:33,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {3809#true} assume 0 == ~st1~0; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {3809#true} assume ~send1~0 == ~id1~0; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {3809#true} assume 0 == ~mode1~0 % 256; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {3809#true} assume ~id2~0 >= 0; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {3809#true} assume 0 == ~st2~0; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {3809#true} assume ~send2~0 == ~id2~0; {3809#true} is VALID [2022-02-20 18:49:33,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {3809#true} assume 0 == ~mode2~0 % 256; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3809#true} assume ~id3~0 >= 0; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3809#true} assume 0 == ~st3~0; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {3809#true} assume ~send3~0 == ~id3~0; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {3809#true} assume 0 == ~mode3~0 % 256; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3809#true} assume ~id4~0 >= 0; {3809#true} is VALID [2022-02-20 18:49:33,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3809#true} assume 0 == ~st4~0; {3809#true} is VALID [2022-02-20 18:49:33,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {3809#true} assume ~send4~0 == ~id4~0; {3809#true} is VALID [2022-02-20 18:49:33,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {3809#true} assume 0 == ~mode4~0 % 256; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {3811#(= (+ (* (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; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,764 INFO L290 TraceCheckUtils]: 44: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3811#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:33,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {3811#(= (+ (* (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; {3810#false} is VALID [2022-02-20 18:49:33,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {3810#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3810#false} is VALID [2022-02-20 18:49:33,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {3810#false} ~mode4~0 := 0; {3810#false} is VALID [2022-02-20 18:49:33,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {3810#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {3810#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {3810#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {3810#false} ~mode5~0 := 0; {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {3810#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {3810#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3810#false} is VALID [2022-02-20 18:49:33,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {3810#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {3810#false} ~mode6~0 := 0; {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {3810#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; {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {3810#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {3810#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {3810#false} assume 0 == main_~assert__arg~0#1 % 256; {3810#false} is VALID [2022-02-20 18:49:33,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {3810#false} assume !false; {3810#false} is VALID [2022-02-20 18:49:33,773 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:49:33,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:33,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536058234] [2022-02-20 18:49:33,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536058234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:33,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:33,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:33,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257532299] [2022-02-20 18:49:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:33,774 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:49:33,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:33,775 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:49:33,817 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:49:33,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:33,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:33,818 INFO L87 Difference]: Start difference. First operand 426 states and 653 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:49:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:34,129 INFO L93 Difference]: Finished difference Result 1126 states and 1767 transitions. [2022-02-20 18:49:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:34,130 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:49:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:34,130 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:49:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:34,133 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:49:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:34,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 558 transitions. [2022-02-20 18:49:34,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:34,497 INFO L225 Difference]: With dead ends: 1126 [2022-02-20 18:49:34,497 INFO L226 Difference]: Without dead ends: 744 [2022-02-20 18:49:34,498 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:49:34,499 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 154 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 489 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:49:34,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 489 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-02-20 18:49:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2022-02-20 18:49:34,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:34,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:34,524 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:34,525 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:34,543 INFO L93 Difference]: Finished difference Result 744 states and 1154 transitions. [2022-02-20 18:49:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1154 transitions. [2022-02-20 18:49:34,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:34,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:34,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 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 744 states. [2022-02-20 18:49:34,546 INFO L87 Difference]: Start difference. First operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 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 744 states. [2022-02-20 18:49:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:34,579 INFO L93 Difference]: Finished difference Result 744 states and 1154 transitions. [2022-02-20 18:49:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1154 transitions. [2022-02-20 18:49:34,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:34,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:34,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:34,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.5560053981106612) internal successors, (1153), 741 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1153 transitions. [2022-02-20 18:49:34,603 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1153 transitions. Word has length 75 [2022-02-20 18:49:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:34,604 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1153 transitions. [2022-02-20 18:49:34,604 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:49:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1153 transitions. [2022-02-20 18:49:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:49:34,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:34,605 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:49:34,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:34,605 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2133086223, now seen corresponding path program 1 times [2022-02-20 18:49:34,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:34,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116133125] [2022-02-20 18:49:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:34,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {7862#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {7862#true} is VALID [2022-02-20 18:49:34,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {7862#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {7862#true} is VALID [2022-02-20 18:49:34,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {7862#true} assume 0 == ~r1~0 % 256; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {7862#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {7862#true} assume ~id1~0 >= 0; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {7862#true} assume 0 == ~st1~0; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {7862#true} assume ~send1~0 == ~id1~0; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {7862#true} assume 0 == ~mode1~0 % 256; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {7862#true} assume ~id2~0 >= 0; {7862#true} is VALID [2022-02-20 18:49:34,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {7862#true} assume 0 == ~st2~0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {7862#true} assume ~send2~0 == ~id2~0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {7862#true} assume 0 == ~mode2~0 % 256; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {7862#true} assume ~id3~0 >= 0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {7862#true} assume 0 == ~st3~0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {7862#true} assume ~send3~0 == ~id3~0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {7862#true} assume 0 == ~mode3~0 % 256; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {7862#true} assume ~id4~0 >= 0; {7862#true} is VALID [2022-02-20 18:49:34,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {7862#true} assume 0 == ~st4~0; {7862#true} is VALID [2022-02-20 18:49:34,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {7862#true} assume ~send4~0 == ~id4~0; {7862#true} is VALID [2022-02-20 18:49:34,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {7862#true} assume 0 == ~mode4~0 % 256; {7862#true} is VALID [2022-02-20 18:49:34,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {7862#true} assume ~id5~0 >= 0; {7862#true} is VALID [2022-02-20 18:49:34,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {7862#true} assume 0 == ~st5~0; {7862#true} is VALID [2022-02-20 18:49:34,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {7862#true} assume ~send5~0 == ~id5~0; {7862#true} is VALID [2022-02-20 18:49:34,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {7862#true} assume 0 == ~mode5~0 % 256; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {7864#(= (+ (* (- 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; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive1~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive2~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive3~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive4~0 % 256); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {7864#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {7864#(= (+ (* (- 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; {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {7863#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {7863#false} ~mode5~0 := 0; {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {7863#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {7863#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {7863#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {7863#false} is VALID [2022-02-20 18:49:34,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {7863#false} ~mode6~0 := 0; {7863#false} is VALID [2022-02-20 18:49:34,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {7863#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; {7863#false} is VALID [2022-02-20 18:49:34,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {7863#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {7863#false} is VALID [2022-02-20 18:49:34,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {7863#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {7863#false} is VALID [2022-02-20 18:49:34,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {7863#false} assume 0 == main_~assert__arg~0#1 % 256; {7863#false} is VALID [2022-02-20 18:49:34,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {7863#false} assume !false; {7863#false} is VALID [2022-02-20 18:49:34,689 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:49:34,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:34,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116133125] [2022-02-20 18:49:34,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116133125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:34,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:34,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:34,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557136201] [2022-02-20 18:49:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:34,691 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:49:34,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:34,691 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:49:34,734 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:49:34,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:34,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:34,735 INFO L87 Difference]: Start difference. First operand 742 states and 1153 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:49:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,161 INFO L93 Difference]: Finished difference Result 2010 states and 3163 transitions. [2022-02-20 18:49:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:35,161 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:49:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:35,162 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:49:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:35,164 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:49:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:35,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 558 transitions. [2022-02-20 18:49:35,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:35,570 INFO L225 Difference]: With dead ends: 2010 [2022-02-20 18:49:35,570 INFO L226 Difference]: Without dead ends: 1312 [2022-02-20 18:49:35,571 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:49:35,572 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 149 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 474 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:49:35,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 474 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-02-20 18:49:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1310. [2022-02-20 18:49:35,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:35,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1312 states. Second operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,612 INFO L74 IsIncluded]: Start isIncluded. First operand 1312 states. Second operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,614 INFO L87 Difference]: Start difference. First operand 1312 states. Second operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,663 INFO L93 Difference]: Finished difference Result 1312 states and 2046 transitions. [2022-02-20 18:49:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2046 transitions. [2022-02-20 18:49:35,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 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 1312 states. [2022-02-20 18:49:35,669 INFO L87 Difference]: Start difference. First operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 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 1312 states. [2022-02-20 18:49:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,721 INFO L93 Difference]: Finished difference Result 1312 states and 2046 transitions. [2022-02-20 18:49:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2046 transitions. [2022-02-20 18:49:35,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:35,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1309 states have (on average 1.562261268143621) internal successors, (2045), 1309 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2045 transitions. [2022-02-20 18:49:35,796 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2045 transitions. Word has length 76 [2022-02-20 18:49:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:35,796 INFO L470 AbstractCegarLoop]: Abstraction has 1310 states and 2045 transitions. [2022-02-20 18:49:35,796 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:49:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2045 transitions. [2022-02-20 18:49:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:49:35,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:35,797 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:49:35,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:49:35,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash 19574795, now seen corresponding path program 1 times [2022-02-20 18:49:35,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:35,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760780485] [2022-02-20 18:49:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:35,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {15075#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {15075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {15075#true} assume 0 == ~r1~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {15075#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {15075#true} assume ~id1~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {15075#true} assume 0 == ~st1~0; {15075#true} is VALID [2022-02-20 18:49:35,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {15075#true} assume ~send1~0 == ~id1~0; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {15075#true} assume 0 == ~mode1~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {15075#true} assume ~id2~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {15075#true} assume 0 == ~st2~0; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {15075#true} assume ~send2~0 == ~id2~0; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {15075#true} assume 0 == ~mode2~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {15075#true} assume ~id3~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {15075#true} assume 0 == ~st3~0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {15075#true} assume ~send3~0 == ~id3~0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {15075#true} assume 0 == ~mode3~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {15075#true} assume ~id4~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {15075#true} assume 0 == ~st4~0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {15075#true} assume ~send4~0 == ~id4~0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {15075#true} assume 0 == ~mode4~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {15075#true} assume ~id5~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {15075#true} assume 0 == ~st5~0; {15075#true} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {15075#true} assume ~send5~0 == ~id5~0; {15075#true} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {15075#true} assume 0 == ~mode5~0 % 256; {15075#true} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {15075#true} assume ~id6~0 >= 0; {15075#true} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {15075#true} assume 0 == ~st6~0; {15075#true} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {15075#true} assume ~send6~0 == ~id6~0; {15075#true} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {15075#true} assume 0 == ~mode6~0 % 256; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {15077#(= (+ (* (- 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; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive1~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode1~0 := 1; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive2~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~id2~0); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode2~0 := 1; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive3~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~id3~0); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode3~0 := 1; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive4~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~id4~0); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode4~0 := 1; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive5~0 % 256); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~id5~0); {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode5~0 := 1; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {15077#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:35,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {15077#(= (+ (* (- 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; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {15076#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {15076#false} ~mode6~0 := 0; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {15076#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; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {15076#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {15076#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {15076#false} assume 0 == main_~assert__arg~0#1 % 256; {15076#false} is VALID [2022-02-20 18:49:35,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {15076#false} assume !false; {15076#false} is VALID [2022-02-20 18:49:35,872 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:49:35,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:35,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760780485] [2022-02-20 18:49:35,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760780485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:35,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:35,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:35,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374671307] [2022-02-20 18:49:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:35,873 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:49:35,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:35,873 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:49:35,922 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:49:35,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:35,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:35,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:35,923 INFO L87 Difference]: Start difference. First operand 1310 states and 2045 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:49:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:36,717 INFO L93 Difference]: Finished difference Result 3586 states and 5631 transitions. [2022-02-20 18:49:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:36,717 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:49:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:36,718 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:49:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:36,720 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:49:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2022-02-20 18:49:36,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 558 transitions. [2022-02-20 18:49:37,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:37,249 INFO L225 Difference]: With dead ends: 3586 [2022-02-20 18:49:37,250 INFO L226 Difference]: Without dead ends: 2320 [2022-02-20 18:49:37,251 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:49:37,254 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 144 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 459 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:49:37,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-02-20 18:49:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2318. [2022-02-20 18:49:37,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:37,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2320 states. Second operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:37,339 INFO L74 IsIncluded]: Start isIncluded. First operand 2320 states. Second operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:37,342 INFO L87 Difference]: Start difference. First operand 2320 states. Second operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:37,497 INFO L93 Difference]: Finished difference Result 2320 states and 3614 transitions. [2022-02-20 18:49:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3614 transitions. [2022-02-20 18:49:37,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:37,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:37,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 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 2320 states. [2022-02-20 18:49:37,504 INFO L87 Difference]: Start difference. First operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 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 2320 states. [2022-02-20 18:49:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:37,647 INFO L93 Difference]: Finished difference Result 2320 states and 3614 transitions. [2022-02-20 18:49:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3614 transitions. [2022-02-20 18:49:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:37,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:37,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.5593439792835564) internal successors, (3613), 2317 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3613 transitions. [2022-02-20 18:49:37,860 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3613 transitions. Word has length 77 [2022-02-20 18:49:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:37,860 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 3613 transitions. [2022-02-20 18:49:37,861 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:49:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3613 transitions. [2022-02-20 18:49:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:49:37,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:37,861 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:49:37,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:37,862 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 366454550, now seen corresponding path program 1 times [2022-02-20 18:49:37,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:37,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333679341] [2022-02-20 18:49:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:37,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:37,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {27912#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {27912#true} is VALID [2022-02-20 18:49:37,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {27912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {27912#true} is VALID [2022-02-20 18:49:37,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {27912#true} assume 0 == ~r1~0 % 256; {27912#true} is VALID [2022-02-20 18:49:37,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {27912#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {27912#true} is VALID [2022-02-20 18:49:37,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {27912#true} assume ~id1~0 >= 0; {27912#true} is VALID [2022-02-20 18:49:37,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {27912#true} assume 0 == ~st1~0; {27914#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:37,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {27914#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {27914#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:37,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {27914#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {27914#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:37,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {27914#(<= ~st1~0 0)} assume ~id2~0 >= 0; {27914#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:37,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {27914#(<= ~st1~0 0)} assume 0 == ~st2~0; {27915#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {27915#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {27915#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {27915#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {27915#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {27915#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {27915#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {27915#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {27916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {27917#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:37,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {27918#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {27919#(<= (+ ~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_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive1~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive2~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive3~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive4~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive5~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,987 INFO L290 TraceCheckUtils]: 67: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,987 INFO L290 TraceCheckUtils]: 68: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive6~0 % 256); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,989 INFO L290 TraceCheckUtils]: 72: Hoare triple {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,989 INFO L290 TraceCheckUtils]: 73: Hoare triple {27919#(<= (+ ~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; {27919#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:37,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {27919#(<= (+ ~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; {27913#false} is VALID [2022-02-20 18:49:37,990 INFO L290 TraceCheckUtils]: 75: Hoare triple {27913#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {27913#false} is VALID [2022-02-20 18:49:37,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {27913#false} assume 0 == main_~assert__arg~0#1 % 256; {27913#false} is VALID [2022-02-20 18:49:37,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {27913#false} assume !false; {27913#false} is VALID [2022-02-20 18:49:37,990 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:49:37,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:37,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333679341] [2022-02-20 18:49:37,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333679341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:37,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:37,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:37,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334779167] [2022-02-20 18:49:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:37,991 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:49:37,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:37,992 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:49:38,040 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:49:38,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:38,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:38,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:38,042 INFO L87 Difference]: Start difference. First operand 2318 states and 3613 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:50:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:01,024 INFO L93 Difference]: Finished difference Result 18236 states and 28596 transitions. [2022-02-20 18:50:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:01,024 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:50:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:01,025 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:50:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1484 transitions. [2022-02-20 18:50:01,029 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:50:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1484 transitions. [2022-02-20 18:50:01,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1484 transitions. [2022-02-20 18:50:01,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1484 edges. 1484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:12,017 INFO L225 Difference]: With dead ends: 18236 [2022-02-20 18:50:12,018 INFO L226 Difference]: Without dead ends: 15962 [2022-02-20 18:50:12,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:50:12,023 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 2490 mSDsluCounter, 2719 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:12,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2490 Valid, 2941 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2022-02-20 18:50:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 4590. [2022-02-20 18:50:15,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:15,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15962 states. Second operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:15,859 INFO L74 IsIncluded]: Start isIncluded. First operand 15962 states. Second operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:15,865 INFO L87 Difference]: Start difference. First operand 15962 states. Second operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,076 INFO L93 Difference]: Finished difference Result 15962 states and 24963 transitions. [2022-02-20 18:50:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 24963 transitions. [2022-02-20 18:50:23,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:23,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:23,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 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 15962 states. [2022-02-20 18:50:23,110 INFO L87 Difference]: Start difference. First operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 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 15962 states. [2022-02-20 18:50:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,496 INFO L93 Difference]: Finished difference Result 15962 states and 24963 transitions. [2022-02-20 18:50:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 24963 transitions. [2022-02-20 18:50:29,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:29,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:29,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:29,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 4589 states have (on average 1.550882545216823) internal successors, (7117), 4589 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 7117 transitions. [2022-02-20 18:50:30,332 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 7117 transitions. Word has length 78 [2022-02-20 18:50:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:30,333 INFO L470 AbstractCegarLoop]: Abstraction has 4590 states and 7117 transitions. [2022-02-20 18:50:30,333 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:50:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 7117 transitions. [2022-02-20 18:50:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:50:30,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:30,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:30,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:30,334 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1544267032, now seen corresponding path program 1 times [2022-02-20 18:50:30,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:30,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137153783] [2022-02-20 18:50:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:30,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {91643#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(65, 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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~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;~alive6~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_104949~0 := 0;~__return_105135~0 := 0; {91643#true} is VALID [2022-02-20 18:50:30,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {91643#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {91643#true} is VALID [2022-02-20 18:50:30,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {91643#true} assume 0 == ~r1~0 % 256; {91643#true} is VALID [2022-02-20 18:50:30,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {91643#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id6~0 >= 0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send6~0 == ~id6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode6~0 % 256; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id6~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104949~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104949~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~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; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:50:30,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {91645#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:50:30,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:50:30,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:50:30,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:50:30,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {91646#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:50:30,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:50:30,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:50:30,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:50:30,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:50:30,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {91647#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:50:30,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:50:30,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:50:30,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:50:30,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:50:30,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {91648#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:50:30,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(~send4~0 != ~id4~0); {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:50:30,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} ~mode4~0 := 1; {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:50:30,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:50:30,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~mode5~0 % 256); {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:50:30,537 INFO L290 TraceCheckUtils]: 65: Hoare triple {91649#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~alive5~0 % 256); {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:50:30,537 INFO L290 TraceCheckUtils]: 66: Hoare triple {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(~send5~0 != ~id5~0); {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:50:30,538 INFO L290 TraceCheckUtils]: 67: Hoare triple {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} ~mode5~0 := 1; {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:50:30,538 INFO L290 TraceCheckUtils]: 68: Hoare triple {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:50:30,538 INFO L290 TraceCheckUtils]: 69: Hoare triple {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~mode6~0 % 256); {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:50:30,538 INFO L290 TraceCheckUtils]: 70: Hoare triple {91650#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~alive6~0 % 256); {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {91644#false} assume !(~send6~0 != ~id6~0); {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {91644#false} ~mode6~0 := 1; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {91644#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; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 74: Hoare triple {91644#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 75: Hoare triple {91644#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 76: Hoare triple {91644#false} ~__return_105135~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105135~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; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 77: Hoare triple {91644#false} assume 0 == main_~assert__arg~0#1 % 256; {91644#false} is VALID [2022-02-20 18:50:30,539 INFO L290 TraceCheckUtils]: 78: Hoare triple {91644#false} assume !false; {91644#false} is VALID [2022-02-20 18:50:30,540 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:50:30,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:30,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137153783] [2022-02-20 18:50:30,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137153783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:30,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:30,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:30,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514143809] [2022-02-20 18:50:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 18:50:30,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:30,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:30,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:30,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:30,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:30,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:30,619 INFO L87 Difference]: Start difference. First operand 4590 states and 7117 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)