./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e806b2de9400f1b211ac03466f80bb324cfea44da3c1d913127efd4a407821e8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:41,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:41,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:41,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:41,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:41,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:41,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:41,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:41,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:41,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:41,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:41,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:41,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:41,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:41,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:41,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:41,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:41,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:41,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:41,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:41,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:41,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:41,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:41,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:41,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:41,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:41,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:41,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:41,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:41,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:41,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:41,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:41,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:41,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:41,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:41,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:41,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:41,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:41,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:41,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:41,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:41,717 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:41,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:41,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:41,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:41,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:41,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:41,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:41,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:41,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:41,745 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:41,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:41,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:41,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:41,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:41,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:41,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:41,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:41,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:41,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:41,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:41,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:41,749 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:41,749 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:41,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:41,749 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 -> e806b2de9400f1b211ac03466f80bb324cfea44da3c1d913127efd4a407821e8 [2022-02-20 18:49:41,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:41,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:41,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:41,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:41,982 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:41,983 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:42,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05063a1f3/ccec74dc210043279206352149259c68/FLAGe74f51825 [2022-02-20 18:49:42,358 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:42,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:42,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05063a1f3/ccec74dc210043279206352149259c68/FLAGe74f51825 [2022-02-20 18:49:42,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05063a1f3/ccec74dc210043279206352149259c68 [2022-02-20 18:49:42,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:42,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:42,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:42,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:42,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:42,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:42" (1/1) ... [2022-02-20 18:49:42,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c32eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:42, skipping insertion in model container [2022-02-20 18:49:42,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:42" (1/1) ... [2022-02-20 18:49:42,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:42,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:43,055 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7399,7412] [2022-02-20 18:49:43,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:43,087 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:43,117 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.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7399,7412] [2022-02-20 18:49:43,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:43,153 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:43,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:43 WrapperNode [2022-02-20 18:49:43,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:43,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:43,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:43,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:43,165 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:43" (1/1) ... [2022-02-20 18:49:43,173 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:43" (1/1) ... [2022-02-20 18:49:43,233 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 619 [2022-02-20 18:49:43,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:43,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:43,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:43,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:43,245 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:43" (1/1) ... [2022-02-20 18:49:43,245 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:43" (1/1) ... [2022-02-20 18:49:43,258 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:43" (1/1) ... [2022-02-20 18:49:43,259 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:43" (1/1) ... [2022-02-20 18:49:43,269 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:43" (1/1) ... [2022-02-20 18:49:43,289 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:43" (1/1) ... [2022-02-20 18:49:43,290 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:43" (1/1) ... [2022-02-20 18:49:43,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:43,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:43,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:43,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:43,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:43" (1/1) ... [2022-02-20 18:49:43,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:43,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:43,322 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:43,338 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:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:43,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:43,496 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:43,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:44,120 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:44,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:44,131 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:44,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:44 BoogieIcfgContainer [2022-02-20 18:49:44,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:44,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:44,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:44,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:44,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:42" (1/3) ... [2022-02-20 18:49:44,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a093c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:44, skipping insertion in model container [2022-02-20 18:49:44,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:43" (2/3) ... [2022-02-20 18:49:44,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a093c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:44, skipping insertion in model container [2022-02-20 18:49:44,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:44" (3/3) ... [2022-02-20 18:49:44,141 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:49:44,145 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:44,145 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:44,178 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:44,182 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:44,182 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call 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:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:49:44,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:44,209 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:44,209 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2011282842, now seen corresponding path program 1 times [2022-02-20 18:49:44,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:44,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535933003] [2022-02-20 18:49:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:44,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {168#true} is VALID [2022-02-20 18:49:44,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#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____CPAchecker_TMP_1~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; {168#true} is VALID [2022-02-20 18:49:44,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume 0 == ~r1~0 % 256; {168#true} is VALID [2022-02-20 18:49:44,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {168#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {168#true} is VALID [2022-02-20 18:49:44,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#true} assume ~id1~0 >= 0; {168#true} is VALID [2022-02-20 18:49:44,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} assume 0 == ~st1~0; {168#true} is VALID [2022-02-20 18:49:44,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume ~send1~0 == ~id1~0; {168#true} is VALID [2022-02-20 18:49:44,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#true} assume 0 == ~mode1~0 % 256; {168#true} is VALID [2022-02-20 18:49:44,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#true} assume ~id2~0 >= 0; {168#true} is VALID [2022-02-20 18:49:44,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#true} assume 0 == ~st2~0; {168#true} is VALID [2022-02-20 18:49:44,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#true} assume ~send2~0 == ~id2~0; {168#true} is VALID [2022-02-20 18:49:44,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {168#true} assume 0 == ~mode2~0 % 256; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {170#(= (+ (* (- 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; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {170#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:44,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {170#(= (+ (* (- 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; {169#false} is VALID [2022-02-20 18:49:44,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {169#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {169#false} is VALID [2022-02-20 18:49:44,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {169#false} ~mode2~0 := 0; {169#false} is VALID [2022-02-20 18:49:44,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {169#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {169#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {169#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {169#false} is VALID [2022-02-20 18:49:44,593 INFO L290 TraceCheckUtils]: 56: Hoare triple {169#false} ~mode3~0 := 0; {169#false} is VALID [2022-02-20 18:49:44,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {169#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {169#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {169#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {169#false} is VALID [2022-02-20 18:49:44,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {169#false} ~mode4~0 := 0; {169#false} is VALID [2022-02-20 18:49:44,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {169#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {169#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {169#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {169#false} is VALID [2022-02-20 18:49:44,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {169#false} ~mode5~0 := 0; {169#false} is VALID [2022-02-20 18:49:44,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {169#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {169#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {169#false} is VALID [2022-02-20 18:49:44,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {169#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {169#false} is VALID [2022-02-20 18:49:44,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {169#false} ~mode6~0 := 0; {169#false} is VALID [2022-02-20 18:49:44,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {169#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; {169#false} is VALID [2022-02-20 18:49:44,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {169#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {169#false} is VALID [2022-02-20 18:49:44,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {169#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {169#false} is VALID [2022-02-20 18:49:44,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {169#false} assume 0 == main_~assert__arg~0#1 % 256; {169#false} is VALID [2022-02-20 18:49:44,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-02-20 18:49:44,600 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:44,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:44,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535933003] [2022-02-20 18:49:44,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535933003] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:44,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:44,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:44,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811621506] [2022-02-20 18:49:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:44,610 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:44,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:44,616 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:44,681 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:44,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:44,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:44,710 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 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.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:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:45,147 INFO L93 Difference]: Finished difference Result 391 states and 633 transitions. [2022-02-20 18:49:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:45,148 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:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:45,149 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:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-02-20 18:49:45,185 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:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-02-20 18:49:45,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 633 transitions. [2022-02-20 18:49:45,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:45,630 INFO L225 Difference]: With dead ends: 391 [2022-02-20 18:49:45,630 INFO L226 Difference]: Without dead ends: 264 [2022-02-20 18:49:45,633 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:45,635 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 205 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 592 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:45,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 592 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:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-02-20 18:49:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2022-02-20 18:49:45,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:45,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call 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:45,672 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call 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:45,672 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call 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:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:45,680 INFO L93 Difference]: Finished difference Result 264 states and 393 transitions. [2022-02-20 18:49:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 393 transitions. [2022-02-20 18:49:45,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:45,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:45,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 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 264 states. [2022-02-20 18:49:45,683 INFO L87 Difference]: Start difference. First operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 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 264 states. [2022-02-20 18:49:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:45,692 INFO L93 Difference]: Finished difference Result 264 states and 393 transitions. [2022-02-20 18:49:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 393 transitions. [2022-02-20 18:49:45,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:45,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:45,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:45,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call 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:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2022-02-20 18:49:45,706 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 74 [2022-02-20 18:49:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:45,706 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2022-02-20 18:49:45,707 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:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2022-02-20 18:49:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:49:45,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:45,708 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:45,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:45,709 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -141824057, now seen corresponding path program 1 times [2022-02-20 18:49:45,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:45,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347229300] [2022-02-20 18:49:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:45,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1570#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1570#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____CPAchecker_TMP_1~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; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1570#true} assume 0 == ~r1~0 % 256; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {1570#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {1570#true} assume ~id1~0 >= 0; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1570#true} assume 0 == ~st1~0; {1570#true} is VALID [2022-02-20 18:49:45,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {1570#true} assume ~send1~0 == ~id1~0; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1570#true} assume 0 == ~mode1~0 % 256; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1570#true} assume ~id2~0 >= 0; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {1570#true} assume 0 == ~st2~0; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1570#true} assume ~send2~0 == ~id2~0; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#true} assume 0 == ~mode2~0 % 256; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1570#true} assume ~id3~0 >= 0; {1570#true} is VALID [2022-02-20 18:49:45,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1570#true} assume 0 == ~st3~0; {1570#true} is VALID [2022-02-20 18:49:45,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1570#true} assume ~send3~0 == ~id3~0; {1570#true} is VALID [2022-02-20 18:49:45,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {1570#true} assume 0 == ~mode3~0 % 256; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {1572#(= (+ (* (- 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; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1572#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {1572#(= (+ (* (- 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; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {1571#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {1571#false} ~mode3~0 := 0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {1571#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {1571#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {1571#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {1571#false} ~mode4~0 := 0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {1571#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 63: Hoare triple {1571#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {1571#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {1571#false} ~mode5~0 := 0; {1571#false} is VALID [2022-02-20 18:49:45,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {1571#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {1571#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {1571#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {1571#false} ~mode6~0 := 0; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {1571#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; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {1571#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {1571#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 73: Hoare triple {1571#false} assume 0 == main_~assert__arg~0#1 % 256; {1571#false} is VALID [2022-02-20 18:49:45,875 INFO L290 TraceCheckUtils]: 74: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2022-02-20 18:49:45,876 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:45,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:45,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347229300] [2022-02-20 18:49:45,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347229300] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:45,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:45,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:45,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300713145] [2022-02-20 18:49:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:45,877 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:45,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:45,877 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:45,941 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:45,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:45,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:45,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:45,943 INFO L87 Difference]: Start difference. First operand 262 states and 392 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:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:46,282 INFO L93 Difference]: Finished difference Result 666 states and 1036 transitions. [2022-02-20 18:49:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:46,282 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:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:46,283 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:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:46,287 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:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:46,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 582 transitions. [2022-02-20 18:49:46,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:46,672 INFO L225 Difference]: With dead ends: 666 [2022-02-20 18:49:46,673 INFO L226 Difference]: Without dead ends: 448 [2022-02-20 18:49:46,679 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:46,680 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 166 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 520 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:46,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 520 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:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-02-20 18:49:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2022-02-20 18:49:46,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:46,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call 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:46,703 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call 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:46,705 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call 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:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:46,717 INFO L93 Difference]: Finished difference Result 448 states and 686 transitions. [2022-02-20 18:49:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 686 transitions. [2022-02-20 18:49:46,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:46,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:46,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 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 448 states. [2022-02-20 18:49:46,720 INFO L87 Difference]: Start difference. First operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 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 448 states. [2022-02-20 18:49:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:46,731 INFO L93 Difference]: Finished difference Result 448 states and 686 transitions. [2022-02-20 18:49:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 686 transitions. [2022-02-20 18:49:46,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:46,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:46,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:46,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call 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:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 685 transitions. [2022-02-20 18:49:46,746 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 685 transitions. Word has length 75 [2022-02-20 18:49:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:46,746 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 685 transitions. [2022-02-20 18:49:46,746 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:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 685 transitions. [2022-02-20 18:49:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:49:46,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:46,747 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:46,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:46,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash 890430339, now seen corresponding path program 1 times [2022-02-20 18:49:46,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:46,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667801299] [2022-02-20 18:49:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:46,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {3979#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {3979#true} is VALID [2022-02-20 18:49:46,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {3979#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____CPAchecker_TMP_1~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; {3979#true} is VALID [2022-02-20 18:49:46,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {3979#true} assume 0 == ~r1~0 % 256; {3979#true} is VALID [2022-02-20 18:49:46,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {3979#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {3979#true} assume ~id1~0 >= 0; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {3979#true} assume 0 == ~st1~0; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {3979#true} assume ~send1~0 == ~id1~0; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {3979#true} assume 0 == ~mode1~0 % 256; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {3979#true} assume ~id2~0 >= 0; {3979#true} is VALID [2022-02-20 18:49:46,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {3979#true} assume 0 == ~st2~0; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {3979#true} assume ~send2~0 == ~id2~0; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {3979#true} assume 0 == ~mode2~0 % 256; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {3979#true} assume ~id3~0 >= 0; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {3979#true} assume 0 == ~st3~0; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {3979#true} assume ~send3~0 == ~id3~0; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {3979#true} assume 0 == ~mode3~0 % 256; {3979#true} is VALID [2022-02-20 18:49:46,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {3979#true} assume ~id4~0 >= 0; {3979#true} is VALID [2022-02-20 18:49:46,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {3979#true} assume 0 == ~st4~0; {3979#true} is VALID [2022-02-20 18:49:46,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {3979#true} assume ~send4~0 == ~id4~0; {3979#true} is VALID [2022-02-20 18:49:46,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {3979#true} assume 0 == ~mode4~0 % 256; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {3981#(= (+ (* (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; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3981#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:49:46,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {3981#(= (+ (* (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; {3980#false} is VALID [2022-02-20 18:49:46,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {3980#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3980#false} is VALID [2022-02-20 18:49:46,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {3980#false} ~mode4~0 := 0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {3980#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {3980#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {3980#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {3980#false} ~mode5~0 := 0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {3980#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {3980#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3980#false} is VALID [2022-02-20 18:49:46,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {3980#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {3980#false} ~mode6~0 := 0; {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {3980#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; {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {3980#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {3980#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {3980#false} assume 0 == main_~assert__arg~0#1 % 256; {3980#false} is VALID [2022-02-20 18:49:46,895 INFO L290 TraceCheckUtils]: 75: Hoare triple {3980#false} assume !false; {3980#false} is VALID [2022-02-20 18:49:46,896 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:46,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:46,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667801299] [2022-02-20 18:49:46,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667801299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:46,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:46,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:46,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814070115] [2022-02-20 18:49:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:46,897 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:46,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:46,897 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:46,945 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:46,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:46,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:46,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:46,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:46,947 INFO L87 Difference]: Start difference. First operand 446 states and 685 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:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:47,291 INFO L93 Difference]: Finished difference Result 1186 states and 1863 transitions. [2022-02-20 18:49:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:47,291 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:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:47,292 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:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:47,295 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:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:47,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 582 transitions. [2022-02-20 18:49:47,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:47,715 INFO L225 Difference]: With dead ends: 1186 [2022-02-20 18:49:47,716 INFO L226 Difference]: Without dead ends: 784 [2022-02-20 18:49:47,716 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:47,717 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 161 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 505 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:47,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 505 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:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-02-20 18:49:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2022-02-20 18:49:47,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:47,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 784 states. Second operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call 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:47,747 INFO L74 IsIncluded]: Start isIncluded. First operand 784 states. Second operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call 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:47,748 INFO L87 Difference]: Start difference. First operand 784 states. Second operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call 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:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:47,771 INFO L93 Difference]: Finished difference Result 784 states and 1218 transitions. [2022-02-20 18:49:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2022-02-20 18:49:47,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:47,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:47,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 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 784 states. [2022-02-20 18:49:47,775 INFO L87 Difference]: Start difference. First operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 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 784 states. [2022-02-20 18:49:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:47,799 INFO L93 Difference]: Finished difference Result 784 states and 1218 transitions. [2022-02-20 18:49:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2022-02-20 18:49:47,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:47,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:47,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:47,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call 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:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1217 transitions. [2022-02-20 18:49:47,830 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1217 transitions. Word has length 76 [2022-02-20 18:49:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:47,830 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 1217 transitions. [2022-02-20 18:49:47,830 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:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1217 transitions. [2022-02-20 18:49:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:49:47,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:47,831 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:47,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:47,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -806203398, now seen corresponding path program 1 times [2022-02-20 18:49:47,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:47,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193681044] [2022-02-20 18:49:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:47,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {8252#true} is VALID [2022-02-20 18:49:47,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#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____CPAchecker_TMP_1~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; {8252#true} is VALID [2022-02-20 18:49:47,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume 0 == ~r1~0 % 256; {8252#true} is VALID [2022-02-20 18:49:47,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {8252#true} assume ~id1~0 >= 0; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {8252#true} assume 0 == ~st1~0; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {8252#true} assume ~send1~0 == ~id1~0; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {8252#true} assume 0 == ~mode1~0 % 256; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {8252#true} assume ~id2~0 >= 0; {8252#true} is VALID [2022-02-20 18:49:47,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8252#true} assume 0 == ~st2~0; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {8252#true} assume ~send2~0 == ~id2~0; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {8252#true} assume 0 == ~mode2~0 % 256; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {8252#true} assume ~id3~0 >= 0; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {8252#true} assume 0 == ~st3~0; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {8252#true} assume ~send3~0 == ~id3~0; {8252#true} is VALID [2022-02-20 18:49:47,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {8252#true} assume 0 == ~mode3~0 % 256; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {8252#true} assume ~id4~0 >= 0; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {8252#true} assume 0 == ~st4~0; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {8252#true} assume ~send4~0 == ~id4~0; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {8252#true} assume 0 == ~mode4~0 % 256; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {8252#true} assume ~id5~0 >= 0; {8252#true} is VALID [2022-02-20 18:49:47,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {8252#true} assume 0 == ~st5~0; {8252#true} is VALID [2022-02-20 18:49:47,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {8252#true} assume ~send5~0 == ~id5~0; {8252#true} is VALID [2022-02-20 18:49:47,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {8252#true} assume 0 == ~mode5~0 % 256; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {8254#(= (+ (* (- 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; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive1~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive2~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive3~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,960 INFO L290 TraceCheckUtils]: 59: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive4~0 % 256); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,961 INFO L290 TraceCheckUtils]: 62: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,961 INFO L290 TraceCheckUtils]: 63: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {8254#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:49:47,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {8254#(= (+ (* (- 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; {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {8253#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 67: Hoare triple {8253#false} ~mode5~0 := 0; {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 68: Hoare triple {8253#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {8253#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 70: Hoare triple {8253#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {8253#false} is VALID [2022-02-20 18:49:47,963 INFO L290 TraceCheckUtils]: 71: Hoare triple {8253#false} ~mode6~0 := 0; {8253#false} is VALID [2022-02-20 18:49:47,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 18:49:47,964 INFO L290 TraceCheckUtils]: 73: Hoare triple {8253#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {8253#false} is VALID [2022-02-20 18:49:47,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {8253#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {8253#false} is VALID [2022-02-20 18:49:47,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {8253#false} assume 0 == main_~assert__arg~0#1 % 256; {8253#false} is VALID [2022-02-20 18:49:47,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {8253#false} assume !false; {8253#false} is VALID [2022-02-20 18:49:47,965 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:47,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:47,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193681044] [2022-02-20 18:49:47,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193681044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:47,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:47,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:47,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043671590] [2022-02-20 18:49:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:47,966 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:47,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:47,967 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:48,022 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:48,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:48,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:48,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:48,023 INFO L87 Difference]: Start difference. First operand 782 states and 1217 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:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:48,525 INFO L93 Difference]: Finished difference Result 2130 states and 3355 transitions. [2022-02-20 18:49:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:48,526 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:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:48,526 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:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:48,535 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:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:48,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 582 transitions. [2022-02-20 18:49:48,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:48,975 INFO L225 Difference]: With dead ends: 2130 [2022-02-20 18:49:48,975 INFO L226 Difference]: Without dead ends: 1392 [2022-02-20 18:49:48,976 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:48,977 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 156 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 490 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:48,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 490 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:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-02-20 18:49:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2022-02-20 18:49:49,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:49,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1392 states. Second operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call 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:49,036 INFO L74 IsIncluded]: Start isIncluded. First operand 1392 states. Second operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call 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:49,038 INFO L87 Difference]: Start difference. First operand 1392 states. Second operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call 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:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:49,094 INFO L93 Difference]: Finished difference Result 1392 states and 2174 transitions. [2022-02-20 18:49:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2174 transitions. [2022-02-20 18:49:49,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:49,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:49,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 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 1392 states. [2022-02-20 18:49:49,101 INFO L87 Difference]: Start difference. First operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 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 1392 states. [2022-02-20 18:49:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:49,157 INFO L93 Difference]: Finished difference Result 1392 states and 2174 transitions. [2022-02-20 18:49:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2174 transitions. [2022-02-20 18:49:49,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:49,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:49,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:49,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call 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:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2173 transitions. [2022-02-20 18:49:49,235 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2173 transitions. Word has length 77 [2022-02-20 18:49:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:49,235 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 2173 transitions. [2022-02-20 18:49:49,235 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:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2173 transitions. [2022-02-20 18:49:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:49:49,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:49,236 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:49,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:49:49,236 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -904090240, now seen corresponding path program 1 times [2022-02-20 18:49:49,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:49,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425658793] [2022-02-20 18:49:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:49,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {15905#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {15905#true} is VALID [2022-02-20 18:49:49,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {15905#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____CPAchecker_TMP_1~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; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {15905#true} assume 0 == ~r1~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {15905#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {15905#true} assume ~id1~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {15905#true} assume 0 == ~st1~0; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {15905#true} assume ~send1~0 == ~id1~0; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {15905#true} assume 0 == ~mode1~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {15905#true} assume ~id2~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {15905#true} assume 0 == ~st2~0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {15905#true} assume ~send2~0 == ~id2~0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {15905#true} assume 0 == ~mode2~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {15905#true} assume ~id3~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {15905#true} assume 0 == ~st3~0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {15905#true} assume ~send3~0 == ~id3~0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {15905#true} assume 0 == ~mode3~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {15905#true} assume ~id4~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {15905#true} assume 0 == ~st4~0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {15905#true} assume ~send4~0 == ~id4~0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {15905#true} assume 0 == ~mode4~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {15905#true} assume ~id5~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {15905#true} assume 0 == ~st5~0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {15905#true} assume ~send5~0 == ~id5~0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {15905#true} assume 0 == ~mode5~0 % 256; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {15905#true} assume ~id6~0 >= 0; {15905#true} is VALID [2022-02-20 18:49:49,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {15905#true} assume 0 == ~st6~0; {15905#true} is VALID [2022-02-20 18:49:49,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {15905#true} assume ~send6~0 == ~id6~0; {15905#true} is VALID [2022-02-20 18:49:49,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {15905#true} assume 0 == ~mode6~0 % 256; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {15907#(= (+ (* (- 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; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive1~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~id1~0); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode1~0 := 1; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive2~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~id2~0); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode2~0 := 1; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive3~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~id3~0); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode3~0 := 1; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive4~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~id4~0); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode4~0 := 1; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~alive5~0 % 256); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~id5~0); {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~mode5~0 := 1; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {15907#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:49:49,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {15907#(= (+ (* (- 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; {15906#false} is VALID [2022-02-20 18:49:49,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {15906#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {15906#false} is VALID [2022-02-20 18:49:49,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {15906#false} ~mode6~0 := 0; {15906#false} is VALID [2022-02-20 18:49:49,324 INFO L290 TraceCheckUtils]: 73: Hoare triple {15906#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; {15906#false} is VALID [2022-02-20 18:49:49,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {15906#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {15906#false} is VALID [2022-02-20 18:49:49,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {15906#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {15906#false} is VALID [2022-02-20 18:49:49,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {15906#false} assume 0 == main_~assert__arg~0#1 % 256; {15906#false} is VALID [2022-02-20 18:49:49,325 INFO L290 TraceCheckUtils]: 77: Hoare triple {15906#false} assume !false; {15906#false} is VALID [2022-02-20 18:49:49,325 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:49,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:49,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425658793] [2022-02-20 18:49:49,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425658793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:49,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:49,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:49,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306545252] [2022-02-20 18:49:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:49,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:49,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:49,372 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:49,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:49,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:49,373 INFO L87 Difference]: Start difference. First operand 1390 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:50,307 INFO L93 Difference]: Finished difference Result 3826 states and 6015 transitions. [2022-02-20 18:49:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:50,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2022-02-20 18:49:50,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 582 transitions. [2022-02-20 18:49:50,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:50,933 INFO L225 Difference]: With dead ends: 3826 [2022-02-20 18:49:50,934 INFO L226 Difference]: Without dead ends: 2480 [2022-02-20 18:49:50,935 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:50,936 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 151 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 475 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:50,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 475 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:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2022-02-20 18:49:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2478. [2022-02-20 18:49:51,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:51,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2480 states. Second operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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:51,027 INFO L74 IsIncluded]: Start isIncluded. First operand 2480 states. Second operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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:51,041 INFO L87 Difference]: Start difference. First operand 2480 states. Second operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,229 INFO L93 Difference]: Finished difference Result 2480 states and 3870 transitions. [2022-02-20 18:49:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3870 transitions. [2022-02-20 18:49:51,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:51,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:51,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 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 2480 states. [2022-02-20 18:49:51,240 INFO L87 Difference]: Start difference. First operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 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 2480 states. [2022-02-20 18:49:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,433 INFO L93 Difference]: Finished difference Result 2480 states and 3870 transitions. [2022-02-20 18:49:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3870 transitions. [2022-02-20 18:49:51,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:51,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:51,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:51,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call 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:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3869 transitions. [2022-02-20 18:49:51,699 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3869 transitions. Word has length 78 [2022-02-20 18:49:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:51,699 INFO L470 AbstractCegarLoop]: Abstraction has 2478 states and 3869 transitions. [2022-02-20 18:49:51,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3869 transitions. [2022-02-20 18:49:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:49:51,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:51,700 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:49:51,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:51,701 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1797609537, now seen corresponding path program 1 times [2022-02-20 18:49:51,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:51,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773665185] [2022-02-20 18:49:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:51,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {29622#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(63, 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_182153~0 := 0;~__return_182348~0 := 0; {29622#true} is VALID [2022-02-20 18:49:51,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {29622#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____CPAchecker_TMP_1~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; {29622#true} is VALID [2022-02-20 18:49:51,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {29622#true} assume 0 == ~r1~0 % 256; {29622#true} is VALID [2022-02-20 18:49:51,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {29622#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {29622#true} is VALID [2022-02-20 18:49:51,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {29622#true} assume ~id1~0 >= 0; {29622#true} is VALID [2022-02-20 18:49:51,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {29622#true} assume 0 == ~st1~0; {29624#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:51,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {29624#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {29624#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:51,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {29624#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {29624#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:51,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {29624#(<= ~st1~0 0)} assume ~id2~0 >= 0; {29624#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:51,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {29624#(<= ~st1~0 0)} assume 0 == ~st2~0; {29625#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {29625#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {29625#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {29625#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {29625#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {29625#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {29625#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {29625#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {29626#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {29627#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:51,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {29628#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {29629#(<= (+ ~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_182153~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182153~0; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive1~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~id1~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,809 INFO L290 TraceCheckUtils]: 50: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive2~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive3~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive4~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,815 INFO L290 TraceCheckUtils]: 66: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive5~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive6~0 % 256); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,818 INFO L290 TraceCheckUtils]: 74: Hoare triple {29629#(<= (+ ~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; {29629#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:51,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {29629#(<= (+ ~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; {29623#false} is VALID [2022-02-20 18:49:51,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {29623#false} ~__return_182348~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182348~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; {29623#false} is VALID [2022-02-20 18:49:51,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {29623#false} assume 0 == main_~assert__arg~0#1 % 256; {29623#false} is VALID [2022-02-20 18:49:51,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {29623#false} assume !false; {29623#false} is VALID [2022-02-20 18:49:51,819 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:51,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:51,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773665185] [2022-02-20 18:49:51,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773665185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:51,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:51,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:51,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202684401] [2022-02-20 18:49:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:51,820 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:49:51,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:51,821 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:49:51,874 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:49:51,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:51,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:51,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:51,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:51,875 INFO L87 Difference]: Start difference. First operand 2478 states and 3869 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) [2022-02-20 18:50:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:18,181 INFO L93 Difference]: Finished difference Result 19516 states and 30644 transitions. [2022-02-20 18:50:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:18,181 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:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:50:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1548 transitions. [2022-02-20 18:50:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:50:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1548 transitions. [2022-02-20 18:50:18,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1548 transitions. [2022-02-20 18:50:19,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1548 edges. 1548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:31,468 INFO L225 Difference]: With dead ends: 19516 [2022-02-20 18:50:31,468 INFO L226 Difference]: Without dead ends: 17082 [2022-02-20 18:50:31,474 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:31,475 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 2601 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 3272 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:31,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2601 Valid, 3272 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:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17082 states. [2022-02-20 18:50:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17082 to 4910. [2022-02-20 18:50:36,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:36,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17082 states. Second operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 0 states have call 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:36,288 INFO L74 IsIncluded]: Start isIncluded. First operand 17082 states. Second operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 0 states have call 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:36,292 INFO L87 Difference]: Start difference. First operand 17082 states. Second operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 0 states have call 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:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,631 INFO L93 Difference]: Finished difference Result 17082 states and 26755 transitions. [2022-02-20 18:50:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17082 states and 26755 transitions. [2022-02-20 18:50:44,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:44,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:44,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 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 17082 states. [2022-02-20 18:50:44,668 INFO L87 Difference]: Start difference. First operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 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 17082 states.