./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.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 85ec1c32c0315a0b22a6354a237ce844fc6c407025c71f81c9bc5a5f9bf4b125 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:47:26,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:47:26,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:47:26,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:47:26,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:47:26,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:47:26,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:47:26,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:47:26,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:47:26,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:47:26,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:47:26,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:47:26,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:47:26,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:47:26,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:47:26,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:47:26,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:47:26,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:47:26,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:47:26,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:47:26,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:47:26,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:47:26,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:47:26,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:47:26,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:47:26,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:47:26,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:47:26,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:47:26,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:47:26,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:47:26,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:47:26,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:47:26,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:47:26,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:47:26,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:47:26,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:47:26,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:47:26,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:47:26,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:47:26,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:47:26,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:47:26,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:47:26,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:47:26,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:47:26,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:47:26,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:47:26,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:47:26,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:47:26,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:47:26,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:47:26,541 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:47:26,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:47:26,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:47:26,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:47:26,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:47:26,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:47:26,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:47:26,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:26,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:47:26,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:47:26,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:47:26,545 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:47:26,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:47:26,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:47:26,545 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 -> 85ec1c32c0315a0b22a6354a237ce844fc6c407025c71f81c9bc5a5f9bf4b125 [2022-02-20 19:47:26,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:47:26,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:47:26,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:47:26,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:47:26,767 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:47:26,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c [2022-02-20 19:47:26,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7642986/34724c5ab9ee47d48acb740d7faeb094/FLAG4597becc0 [2022-02-20 19:47:27,351 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:47:27,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c [2022-02-20 19:47:27,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7642986/34724c5ab9ee47d48acb740d7faeb094/FLAG4597becc0 [2022-02-20 19:47:27,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7642986/34724c5ab9ee47d48acb740d7faeb094 [2022-02-20 19:47:27,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:47:27,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:47:27,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:27,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:47:27,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:47:27,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:27" (1/1) ... [2022-02-20 19:47:27,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e08c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:27, skipping insertion in model container [2022-02-20 19:47:27,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:27" (1/1) ... [2022-02-20 19:47:27,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:47:27,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:47:28,024 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c[15482,15495] [2022-02-20 19:47:28,051 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c[18989,19002] [2022-02-20 19:47:28,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:28,595 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:47:28,667 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c[15482,15495] [2022-02-20 19:47:28,678 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c[18989,19002] [2022-02-20 19:47:29,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:29,021 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:47:29,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29 WrapperNode [2022-02-20 19:47:29,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:29,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:29,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:47:29,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:47:29,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,473 INFO L137 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2022-02-20 19:47:29,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:29,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:47:29,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:47:29,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:47:29,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:47:29,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:47:29,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:47:29,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:47:29,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (1/1) ... [2022-02-20 19:47:29,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:47:29,872 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 19:47:29,878 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 19:47:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:47:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:47:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:47:29,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:47:29,989 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:47:29,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:47:36,670 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:47:36,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:47:36,686 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:47:36,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:36 BoogieIcfgContainer [2022-02-20 19:47:36,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:47:36,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:47:36,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:47:36,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:47:36,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:47:27" (1/3) ... [2022-02-20 19:47:36,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cf2f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:36, skipping insertion in model container [2022-02-20 19:47:36,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:29" (2/3) ... [2022-02-20 19:47:36,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cf2f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:36, skipping insertion in model container [2022-02-20 19:47:36,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:36" (3/3) ... [2022-02-20 19:47:36,695 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label08.c [2022-02-20 19:47:36,698 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:47:36,699 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:47:36,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:47:36,758 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 19:47:36,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:47:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:47:36,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:36,802 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] [2022-02-20 19:47:36,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -124772307, now seen corresponding path program 1 times [2022-02-20 19:47:36,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:36,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770172109] [2022-02-20 19:47:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:36,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:37,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet53#1);havoc main_#t~nondet53#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet51#1, main2_#t~ret52#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet51#1 && main2_#t~nondet51#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet51#1;havoc main2_#t~nondet51#1; {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret48#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:47:37,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {931#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {930#false} is VALID [2022-02-20 19:47:37,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-02-20 19:47:37,134 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 19:47:37,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:37,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770172109] [2022-02-20 19:47:37,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770172109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:37,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:37,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:37,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221724576] [2022-02-20 19:47:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:37,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:47:37,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:37,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:37,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:37,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:37,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:37,199 INFO L87 Difference]: Start difference. First operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:42,824 INFO L93 Difference]: Finished difference Result 2577 states and 4936 transitions. [2022-02-20 19:47:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:47:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4936 transitions. [2022-02-20 19:47:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4936 transitions. [2022-02-20 19:47:42,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4936 transitions. [2022-02-20 19:47:46,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4936 edges. 4936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:46,697 INFO L225 Difference]: With dead ends: 2577 [2022-02-20 19:47:46,698 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:47:46,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:47:46,708 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 975 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:46,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 711 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:47:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:47:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:47:46,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:46,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,865 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,868 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:46,971 INFO L93 Difference]: Finished difference Result 1611 states and 2599 transitions. [2022-02-20 19:47:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2599 transitions. [2022-02-20 19:47:46,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:46,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:46,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:46,985 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:47,092 INFO L93 Difference]: Finished difference Result 1611 states and 2599 transitions. [2022-02-20 19:47:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2599 transitions. [2022-02-20 19:47:47,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:47,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:47,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:47,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.615288999378496) internal successors, (2599), 1610 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2599 transitions. [2022-02-20 19:47:47,196 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2599 transitions. Word has length 30 [2022-02-20 19:47:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:47,201 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2599 transitions. [2022-02-20 19:47:47,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2599 transitions. [2022-02-20 19:47:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:47,203 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:47,203 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] [2022-02-20 19:47:47,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:47:47,204 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 615382892, now seen corresponding path program 1 times [2022-02-20 19:47:47,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:47,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577044216] [2022-02-20 19:47:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:47,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {8403#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8403#true} is VALID [2022-02-20 19:47:47,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {8403#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {8403#true} is VALID [2022-02-20 19:47:47,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {8403#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8403#true} is VALID [2022-02-20 19:47:47,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {8403#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8405#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:47:47,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {8405#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8406#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:47:47,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {8406#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8407#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:47:47,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {8407#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8404#false} is VALID [2022-02-20 19:47:47,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {8404#false} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {8404#false} is VALID [2022-02-20 19:47:47,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {8404#false} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {8404#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {8404#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {8404#false} ~mode1~0 := 0; {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {8404#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#false} assume !(0 != ~mode2~0 % 256); {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {8404#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8404#false} is VALID [2022-02-20 19:47:47,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#false} assume !(0 != ~mode3~0 % 256); {8404#false} is VALID [2022-02-20 19:47:47,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {8404#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8404#false} is VALID [2022-02-20 19:47:47,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {8404#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {8404#false} is VALID [2022-02-20 19:47:47,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#false} assume !(0 != ~mode4~0 % 256); {8404#false} is VALID [2022-02-20 19:47:47,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8404#false} is VALID [2022-02-20 19:47:47,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {8404#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8404#false} is VALID [2022-02-20 19:47:47,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {8404#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {8404#false} assume !(0 != ~mode5~0 % 256); {8404#false} is VALID [2022-02-20 19:47:47,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {8404#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8404#false} is VALID [2022-02-20 19:47:47,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {8404#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {8404#false} is VALID [2022-02-20 19:47:47,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {8404#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {8404#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8404#false} is VALID [2022-02-20 19:47:47,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {8404#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8404#false} is VALID [2022-02-20 19:47:47,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {8404#false} ~mode6~0 := 0; {8404#false} is VALID [2022-02-20 19:47:47,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {8404#false} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8404#false} is VALID [2022-02-20 19:47:47,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {8404#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {8404#false} is VALID [2022-02-20 19:47:47,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {8404#false} check_#res#1 := check_~tmp~1#1; {8404#false} is VALID [2022-02-20 19:47:47,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {8404#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8404#false} is VALID [2022-02-20 19:47:47,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {8404#false} assume 0 == assert_~arg#1 % 256; {8404#false} is VALID [2022-02-20 19:47:47,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {8404#false} assume !false; {8404#false} is VALID [2022-02-20 19:47:47,304 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 19:47:47,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:47,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577044216] [2022-02-20 19:47:47,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577044216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:47,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:47,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:47:47,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267989842] [2022-02-20 19:47:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:47,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:47,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:47,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:47,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:47:47,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:47:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:47,331 INFO L87 Difference]: Start difference. First operand 1611 states and 2599 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:51,170 INFO L93 Difference]: Finished difference Result 1675 states and 2698 transitions. [2022-02-20 19:47:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:51,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:51,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1719 transitions. [2022-02-20 19:47:52,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:52,494 INFO L225 Difference]: With dead ends: 1675 [2022-02-20 19:47:52,494 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:47:52,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:47:52,496 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:52,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:47:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:47:52,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:52,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:52,536 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:52,540 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:52,618 INFO L93 Difference]: Finished difference Result 1611 states and 2559 transitions. [2022-02-20 19:47:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2559 transitions. [2022-02-20 19:47:52,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:52,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:52,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:52,627 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:52,702 INFO L93 Difference]: Finished difference Result 1611 states and 2559 transitions. [2022-02-20 19:47:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2559 transitions. [2022-02-20 19:47:52,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:52,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:52,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:52,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.5904288377874456) internal successors, (2559), 1610 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2559 transitions. [2022-02-20 19:47:52,786 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2559 transitions. Word has length 38 [2022-02-20 19:47:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:52,786 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2559 transitions. [2022-02-20 19:47:52,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2559 transitions. [2022-02-20 19:47:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:52,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:52,789 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 19:47:52,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:52,790 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2101054792, now seen corresponding path program 1 times [2022-02-20 19:47:52,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:52,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499047407] [2022-02-20 19:47:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:52,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {14972#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {14972#true} is VALID [2022-02-20 19:47:52,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {14972#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {14972#true} is VALID [2022-02-20 19:47:52,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14972#true} is VALID [2022-02-20 19:47:52,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {14972#true} assume 0 == ~r1~0; {14972#true} is VALID [2022-02-20 19:47:52,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {14972#true} assume ~id1~0 >= 0; {14972#true} is VALID [2022-02-20 19:47:52,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#true} assume 0 == ~st1~0; {14972#true} is VALID [2022-02-20 19:47:52,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {14972#true} assume ~send1~0 == ~id1~0; {14972#true} is VALID [2022-02-20 19:47:52,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#true} assume 0 == ~mode1~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:52,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {14974#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {14973#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14973#false} is VALID [2022-02-20 19:47:52,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {14973#false} ~mode1~0 := 0; {14973#false} is VALID [2022-02-20 19:47:52,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {14973#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {14973#false} assume !(0 != ~mode2~0 % 256); {14973#false} is VALID [2022-02-20 19:47:52,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {14973#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14973#false} is VALID [2022-02-20 19:47:52,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {14973#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {14973#false} is VALID [2022-02-20 19:47:52,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {14973#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {14973#false} assume !(0 != ~mode3~0 % 256); {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {14973#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {14973#false} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {14973#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {14973#false} assume !(0 != ~mode4~0 % 256); {14973#false} is VALID [2022-02-20 19:47:52,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {14973#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {14973#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {14973#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {14973#false} assume !(0 != ~mode5~0 % 256); {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 65: Hoare triple {14973#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {14973#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {14973#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {14973#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {14973#false} assume !(node6_~m6~0#1 != ~nomsg~0); {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 70: Hoare triple {14973#false} ~mode6~0 := 0; {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 71: Hoare triple {14973#false} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {14973#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {14973#false} check_#res#1 := check_~tmp~1#1; {14973#false} is VALID [2022-02-20 19:47:52,921 INFO L290 TraceCheckUtils]: 74: Hoare triple {14973#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14973#false} is VALID [2022-02-20 19:47:52,922 INFO L290 TraceCheckUtils]: 75: Hoare triple {14973#false} assume 0 == assert_~arg#1 % 256; {14973#false} is VALID [2022-02-20 19:47:52,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {14973#false} assume !false; {14973#false} is VALID [2022-02-20 19:47:52,922 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 19:47:52,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:52,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499047407] [2022-02-20 19:47:52,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499047407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:52,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:52,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:52,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282673730] [2022-02-20 19:47:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:52,924 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 19:47:52,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:52,925 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 19:47:52,969 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 19:47:52,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:52,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:52,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:52,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:52,970 INFO L87 Difference]: Start difference. First operand 1611 states and 2559 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 19:47:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:54,641 INFO L93 Difference]: Finished difference Result 1725 states and 2739 transitions. [2022-02-20 19:47:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:54,641 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 19:47:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:54,642 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 19:47:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:54,647 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 19:47:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:54,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:56,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:56,155 INFO L225 Difference]: With dead ends: 1725 [2022-02-20 19:47:56,156 INFO L226 Difference]: Without dead ends: 1665 [2022-02-20 19:47:56,156 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 19:47:56,157 INFO L933 BasicCegarLoop]: 1661 mSDtfsCounter, 1524 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1754 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 19:47:56,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-02-20 19:47:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1663. [2022-02-20 19:47:56,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:56,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:56,192 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:56,195 INFO L87 Difference]: Start difference. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:56,284 INFO L93 Difference]: Finished difference Result 1665 states and 2643 transitions. [2022-02-20 19:47:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2643 transitions. [2022-02-20 19:47:56,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:56,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:56,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 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 1665 states. [2022-02-20 19:47:56,292 INFO L87 Difference]: Start difference. First operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 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 1665 states. [2022-02-20 19:47:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:56,380 INFO L93 Difference]: Finished difference Result 1665 states and 2643 transitions. [2022-02-20 19:47:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2643 transitions. [2022-02-20 19:47:56,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:56,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:56,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:56,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1661 states have (on average 1.5906080674292595) internal successors, (2642), 1662 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2642 transitions. [2022-02-20 19:47:56,498 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2642 transitions. Word has length 77 [2022-02-20 19:47:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:56,498 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 2642 transitions. [2022-02-20 19:47:56,501 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 19:47:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2642 transitions. [2022-02-20 19:47:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:56,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:56,502 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 19:47:56,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:47:56,503 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1452480302, now seen corresponding path program 1 times [2022-02-20 19:47:56,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:56,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603740531] [2022-02-20 19:47:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:56,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {21762#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {21762#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {21762#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {21762#true} assume 0 == ~r1~0; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {21762#true} assume ~id1~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {21762#true} assume 0 == ~st1~0; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {21762#true} assume ~send1~0 == ~id1~0; {21762#true} is VALID [2022-02-20 19:47:56,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {21762#true} assume 0 == ~mode1~0 % 256; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {21762#true} assume ~id2~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {21762#true} assume 0 == ~st2~0; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {21762#true} assume ~send2~0 == ~id2~0; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {21762#true} assume 0 == ~mode2~0 % 256; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {21762#true} assume ~id3~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {21762#true} assume 0 == ~st3~0; {21762#true} is VALID [2022-02-20 19:47:56,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {21762#true} assume ~send3~0 == ~id3~0; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {21762#true} assume 0 == ~mode3~0 % 256; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {21762#true} assume ~id4~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {21762#true} assume 0 == ~st4~0; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {21762#true} assume ~send4~0 == ~id4~0; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {21762#true} assume 0 == ~mode4~0 % 256; {21762#true} is VALID [2022-02-20 19:47:56,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {21762#true} assume ~id5~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {21762#true} assume 0 == ~st5~0; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {21762#true} assume ~send5~0 == ~id5~0; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {21762#true} assume 0 == ~mode5~0 % 256; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {21762#true} assume ~id6~0 >= 0; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {21762#true} assume 0 == ~st6~0; {21762#true} is VALID [2022-02-20 19:47:56,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {21762#true} assume ~send6~0 == ~id6~0; {21762#true} is VALID [2022-02-20 19:47:56,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {21762#true} assume 0 == ~mode6~0 % 256; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,631 INFO L290 TraceCheckUtils]: 67: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:56,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {21764#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {21763#false} is VALID [2022-02-20 19:47:56,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {21763#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21763#false} is VALID [2022-02-20 19:47:56,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {21763#false} ~mode6~0 := 0; {21763#false} is VALID [2022-02-20 19:47:56,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {21763#false} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21763#false} is VALID [2022-02-20 19:47:56,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {21763#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {21763#false} is VALID [2022-02-20 19:47:56,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {21763#false} check_#res#1 := check_~tmp~1#1; {21763#false} is VALID [2022-02-20 19:47:56,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {21763#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21763#false} is VALID [2022-02-20 19:47:56,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {21763#false} assume 0 == assert_~arg#1 % 256; {21763#false} is VALID [2022-02-20 19:47:56,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {21763#false} assume !false; {21763#false} is VALID [2022-02-20 19:47:56,635 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 19:47:56,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:56,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603740531] [2022-02-20 19:47:56,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603740531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:56,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:56,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:56,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663589011] [2022-02-20 19:47:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:56,636 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 19:47:56,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:56,637 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 19:47:56,686 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 19:47:56,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:56,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:56,687 INFO L87 Difference]: Start difference. First operand 1663 states and 2642 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 19:47:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:58,454 INFO L93 Difference]: Finished difference Result 1875 states and 2978 transitions. [2022-02-20 19:47:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:58,454 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 19:47:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:58,454 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 19:47:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:58,461 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 19:47:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:58,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:59,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:59,927 INFO L225 Difference]: With dead ends: 1875 [2022-02-20 19:47:59,927 INFO L226 Difference]: Without dead ends: 1763 [2022-02-20 19:47:59,928 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 19:47:59,928 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1504 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1717 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 19:47:59,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-02-20 19:47:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1761. [2022-02-20 19:47:59,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:59,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:59,973 INFO L74 IsIncluded]: Start isIncluded. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:59,974 INFO L87 Difference]: Start difference. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:00,064 INFO L93 Difference]: Finished difference Result 1763 states and 2798 transitions. [2022-02-20 19:48:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2798 transitions. [2022-02-20 19:48:00,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:00,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:00,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 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 1763 states. [2022-02-20 19:48:00,070 INFO L87 Difference]: Start difference. First operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 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 1763 states. [2022-02-20 19:48:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:00,166 INFO L93 Difference]: Finished difference Result 1763 states and 2798 transitions. [2022-02-20 19:48:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2798 transitions. [2022-02-20 19:48:00,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:00,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:00,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:00,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1759 states have (on average 1.5901080159181353) internal successors, (2797), 1760 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2797 transitions. [2022-02-20 19:48:00,265 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2797 transitions. Word has length 77 [2022-02-20 19:48:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:00,265 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2797 transitions. [2022-02-20 19:48:00,265 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 19:48:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2797 transitions. [2022-02-20 19:48:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:00,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:00,268 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 19:48:00,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:48:00,269 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1624501596, now seen corresponding path program 1 times [2022-02-20 19:48:00,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:00,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569256089] [2022-02-20 19:48:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:00,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {29041#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29041#true} is VALID [2022-02-20 19:48:00,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {29041#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {29041#true} is VALID [2022-02-20 19:48:00,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {29041#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29041#true} is VALID [2022-02-20 19:48:00,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {29041#true} assume 0 == ~r1~0; {29041#true} is VALID [2022-02-20 19:48:00,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {29041#true} assume ~id1~0 >= 0; {29041#true} is VALID [2022-02-20 19:48:00,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {29041#true} assume 0 == ~st1~0; {29043#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:00,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {29043#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {29043#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:00,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {29043#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {29043#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:00,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {29043#(<= ~st1~0 0)} assume ~id2~0 >= 0; {29043#(<= ~st1~0 0)} is VALID [2022-02-20 19:48:00,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {29043#(<= ~st1~0 0)} assume 0 == ~st2~0; {29044#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {29044#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {29044#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {29044#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {29044#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {29044#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {29044#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {29044#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {29045#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {29046#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:48:00,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {29047#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,450 INFO L290 TraceCheckUtils]: 63: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29048#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:48:00,453 INFO L290 TraceCheckUtils]: 72: Hoare triple {29048#(<= (+ ~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);check_~tmp~1#1 := 0; {29042#false} is VALID [2022-02-20 19:48:00,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {29042#false} check_#res#1 := check_~tmp~1#1; {29042#false} is VALID [2022-02-20 19:48:00,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {29042#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29042#false} is VALID [2022-02-20 19:48:00,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {29042#false} assume 0 == assert_~arg#1 % 256; {29042#false} is VALID [2022-02-20 19:48:00,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {29042#false} assume !false; {29042#false} is VALID [2022-02-20 19:48:00,455 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 19:48:00,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:00,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569256089] [2022-02-20 19:48:00,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569256089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:00,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:00,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:00,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211443736] [2022-02-20 19:48:00,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:00,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:00,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:00,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:00,500 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 19:48:00,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:00,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:00,501 INFO L87 Difference]: Start difference. First operand 1761 states and 2797 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:06,379 INFO L93 Difference]: Finished difference Result 4281 states and 6793 transitions. [2022-02-20 19:48:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 19:48:06,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:48:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:48:06,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 2720 transitions. [2022-02-20 19:48:08,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2720 edges. 2720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:08,967 INFO L225 Difference]: With dead ends: 4281 [2022-02-20 19:48:08,968 INFO L226 Difference]: Without dead ends: 4071 [2022-02-20 19:48:08,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:48:08,969 INFO L933 BasicCegarLoop]: 1574 mSDtfsCounter, 10491 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10491 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:08,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10491 Valid, 2765 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:48:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-02-20 19:48:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 1969. [2022-02-20 19:48:09,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:09,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,245 INFO L74 IsIncluded]: Start isIncluded. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,247 INFO L87 Difference]: Start difference. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:09,679 INFO L93 Difference]: Finished difference Result 4071 states and 6412 transitions. [2022-02-20 19:48:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6412 transitions. [2022-02-20 19:48:09,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:09,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:09,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 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 4071 states. [2022-02-20 19:48:09,689 INFO L87 Difference]: Start difference. First operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 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 4071 states. [2022-02-20 19:48:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:10,143 INFO L93 Difference]: Finished difference Result 4071 states and 6412 transitions. [2022-02-20 19:48:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6412 transitions. [2022-02-20 19:48:10,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:10,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:10,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:10,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1967 states have (on average 1.5866802236909) internal successors, (3121), 1968 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3121 transitions. [2022-02-20 19:48:10,260 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3121 transitions. Word has length 77 [2022-02-20 19:48:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:10,261 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 3121 transitions. [2022-02-20 19:48:10,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 19:48:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3121 transitions. [2022-02-20 19:48:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:48:10,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:10,262 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 19:48:10,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:48:10,262 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash 806369108, now seen corresponding path program 1 times [2022-02-20 19:48:10,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:10,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553113226] [2022-02-20 19:48:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:10,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {44024#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {44024#true} is VALID [2022-02-20 19:48:10,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {44024#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {44024#true} is VALID [2022-02-20 19:48:10,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {44024#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {44024#true} is VALID [2022-02-20 19:48:10,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {44024#true} assume 0 == ~r1~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st1~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {44026#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {44026#(<= ~r1~0 0)} assume ~id2~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st2~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {44026#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {44026#(<= ~r1~0 0)} assume ~id3~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st3~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {44026#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {44026#(<= ~r1~0 0)} assume ~id4~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {44026#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {44026#(<= ~r1~0 0)} assume ~id5~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {44026#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {44026#(<= ~r1~0 0)} assume ~id6~0 >= 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~st6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {44026#(<= ~r1~0 0)} assume ~send6~0 == ~id6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {44026#(<= ~r1~0 0)} assume 0 == ~mode6~0 % 256; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {44026#(<= ~r1~0 0)} assume ~id1~0 != ~id6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {44026#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {44026#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {44026#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {44026#(<= ~r1~0 0)} assume ~id2~0 != ~id6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {44026#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {44026#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {44026#(<= ~r1~0 0)} assume ~id3~0 != ~id6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {44026#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {44026#(<= ~r1~0 0)} assume ~id4~0 != ~id6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {44026#(<= ~r1~0 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {44026#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {44026#(<= ~r1~0 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {44026#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {44026#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {44026#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {44026#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {44026#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {44026#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {44026#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {44026#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {44026#(<= ~r1~0 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {44026#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {44026#(<= ~r1~0 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {44026#(<= ~r1~0 0)} assume !(0 != ~mode6~0 % 256); {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {44026#(<= ~r1~0 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {44026#(<= ~r1~0 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {44026#(<= ~r1~0 0)} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {44026#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {44026#(<= ~r1~0 0)} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {44026#(<= ~r1~0 0)} assume ~r1~0 >= 6; {44025#false} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {44025#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {44025#false} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {44025#false} check_#res#1 := check_~tmp~1#1; {44025#false} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {44025#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {44025#false} is VALID [2022-02-20 19:48:10,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {44025#false} assume 0 == assert_~arg#1 % 256; {44025#false} is VALID [2022-02-20 19:48:10,327 INFO L290 TraceCheckUtils]: 78: Hoare triple {44025#false} assume !false; {44025#false} is VALID [2022-02-20 19:48:10,327 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 19:48:10,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:10,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553113226] [2022-02-20 19:48:10,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553113226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:10,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:10,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:10,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847172988] [2022-02-20 19:48:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:10,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:10,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:10,373 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 19:48:10,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:10,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:10,374 INFO L87 Difference]: Start difference. First operand 1969 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:12,089 INFO L93 Difference]: Finished difference Result 2589 states and 4093 transitions. [2022-02-20 19:48:12,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:48:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:48:12,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1761 transitions. [2022-02-20 19:48:13,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1761 edges. 1761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:13,457 INFO L225 Difference]: With dead ends: 2589 [2022-02-20 19:48:13,458 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 19:48:13,459 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 19:48:13,460 INFO L933 BasicCegarLoop]: 1585 mSDtfsCounter, 1496 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:13,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 1675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 19:48:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 19:48:13,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:13,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,872 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,873 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:13,997 INFO L93 Difference]: Finished difference Result 2171 states and 3430 transitions. [2022-02-20 19:48:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3430 transitions. [2022-02-20 19:48:13,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:13,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:14,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:48:14,003 INFO L87 Difference]: Start difference. First operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:48:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:14,128 INFO L93 Difference]: Finished difference Result 2171 states and 3430 transitions. [2022-02-20 19:48:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3430 transitions. [2022-02-20 19:48:14,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:14,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:14,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:14,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.582371942778034) internal successors, (3429), 2168 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3429 transitions. [2022-02-20 19:48:14,265 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3429 transitions. Word has length 79 [2022-02-20 19:48:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:14,265 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3429 transitions. [2022-02-20 19:48:14,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3429 transitions. [2022-02-20 19:48:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:48:14,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:14,266 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 19:48:14,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:48:14,266 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash 872862620, now seen corresponding path program 1 times [2022-02-20 19:48:14,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:14,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218581772] [2022-02-20 19:48:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:14,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {53437#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {53437#true} is VALID [2022-02-20 19:48:14,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {53437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {53437#true} is VALID [2022-02-20 19:48:14,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {53437#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {53437#true} is VALID [2022-02-20 19:48:14,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {53437#true} assume 0 == ~r1~0; {53437#true} is VALID [2022-02-20 19:48:14,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {53437#true} assume ~id1~0 >= 0; {53437#true} is VALID [2022-02-20 19:48:14,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {53437#true} assume 0 == ~st1~0; {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {53439#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st2~0; {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send2~0 == ~id2~0; {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode2~0 % 256; {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id3~0 >= 0; {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {53440#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st3~0; {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:14,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~send3~0 == ~id3~0; {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:14,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode3~0 % 256; {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:14,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~id4~0 >= 0; {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:14,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {53441#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st4~0; {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {53442#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st5~0; {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send5~0 == ~id5~0; {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode5~0 % 256; {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id6~0 >= 0; {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:14,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {53443#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 == ~id6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume 0 == ~mode6~0 % 256; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,499 INFO L290 TraceCheckUtils]: 63: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,502 INFO L290 TraceCheckUtils]: 71: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~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; {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~r1~0 >= 6); {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:14,504 INFO L290 TraceCheckUtils]: 74: Hoare triple {53444#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; {53438#false} is VALID [2022-02-20 19:48:14,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {53438#false} check_#res#1 := check_~tmp~1#1; {53438#false} is VALID [2022-02-20 19:48:14,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {53438#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {53438#false} is VALID [2022-02-20 19:48:14,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {53438#false} assume 0 == assert_~arg#1 % 256; {53438#false} is VALID [2022-02-20 19:48:14,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {53438#false} assume !false; {53438#false} is VALID [2022-02-20 19:48:14,504 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 19:48:14,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:14,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218581772] [2022-02-20 19:48:14,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218581772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:14,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:14,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:14,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195191154] [2022-02-20 19:48:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:14,506 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 19:48:14,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:14,506 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 19:48:14,564 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 19:48:14,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:14,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:14,565 INFO L87 Difference]: Start difference. First operand 2169 states and 3429 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 19:48:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:19,287 INFO L93 Difference]: Finished difference Result 2787 states and 4393 transitions. [2022-02-20 19:48:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:48:19,287 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 19:48:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:19,287 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 19:48:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1768 transitions. [2022-02-20 19:48:19,292 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 19:48:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1768 transitions. [2022-02-20 19:48:19,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1768 transitions. [2022-02-20 19:48:20,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1768 edges. 1768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:20,843 INFO L225 Difference]: With dead ends: 2787 [2022-02-20 19:48:20,843 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 19:48:20,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:48:20,844 INFO L933 BasicCegarLoop]: 1597 mSDtfsCounter, 6277 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6277 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:20,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6277 Valid, 2058 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:48:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 19:48:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 19:48:21,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:21,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,221 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,223 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,343 INFO L93 Difference]: Finished difference Result 2171 states and 3424 transitions. [2022-02-20 19:48:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3424 transitions. [2022-02-20 19:48:21,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:48:21,349 INFO L87 Difference]: Start difference. First operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:48:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,479 INFO L93 Difference]: Finished difference Result 2171 states and 3424 transitions. [2022-02-20 19:48:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3424 transitions. [2022-02-20 19:48:21,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:21,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.5796031379787725) internal successors, (3423), 2168 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3423 transitions. [2022-02-20 19:48:21,613 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3423 transitions. Word has length 79 [2022-02-20 19:48:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:21,613 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3423 transitions. [2022-02-20 19:48:21,613 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:48:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3423 transitions. [2022-02-20 19:48:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:48:21,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:21,614 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 19:48:21,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:48:21,614 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -385682984, now seen corresponding path program 1 times [2022-02-20 19:48:21,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:21,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459056487] [2022-02-20 19:48:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:21,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {63095#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {63095#true} is VALID [2022-02-20 19:48:21,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {63095#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {63095#true} is VALID [2022-02-20 19:48:21,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {63095#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {63095#true} assume 0 == ~r1~0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {63095#true} assume ~id1~0 >= 0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {63095#true} assume 0 == ~st1~0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {63095#true} assume ~send1~0 == ~id1~0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {63095#true} assume 0 == ~mode1~0 % 256; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {63095#true} assume ~id2~0 >= 0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {63095#true} assume 0 == ~st2~0; {63095#true} is VALID [2022-02-20 19:48:21,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {63095#true} assume ~send2~0 == ~id2~0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {63095#true} assume 0 == ~mode2~0 % 256; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {63095#true} assume ~id3~0 >= 0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {63095#true} assume 0 == ~st3~0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {63095#true} assume ~send3~0 == ~id3~0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {63095#true} assume 0 == ~mode3~0 % 256; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {63095#true} assume ~id4~0 >= 0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {63095#true} assume 0 == ~st4~0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {63095#true} assume ~send4~0 == ~id4~0; {63095#true} is VALID [2022-02-20 19:48:21,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {63095#true} assume 0 == ~mode4~0 % 256; {63095#true} is VALID [2022-02-20 19:48:21,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {63095#true} assume ~id5~0 >= 0; {63095#true} is VALID [2022-02-20 19:48:21,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {63095#true} assume 0 == ~st5~0; {63095#true} is VALID [2022-02-20 19:48:21,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {63095#true} assume ~send5~0 == ~id5~0; {63095#true} is VALID [2022-02-20 19:48:21,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {63095#true} assume 0 == ~mode5~0 % 256; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,690 INFO L290 TraceCheckUtils]: 59: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:21,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {63097#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {63096#false} assume node5_~m5~0#1 != ~nomsg~0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {63096#false} assume !(node5_~m5~0#1 > ~id5~0); {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {63096#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {63096#false} ~mode5~0 := 0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {63096#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {63096#false} assume !(0 != ~mode6~0 % 256); {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {63096#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {63096#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 73: Hoare triple {63096#false} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {63096#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {63096#false} is VALID [2022-02-20 19:48:21,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {63096#false} check_#res#1 := check_~tmp~1#1; {63096#false} is VALID [2022-02-20 19:48:21,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {63096#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {63096#false} is VALID [2022-02-20 19:48:21,694 INFO L290 TraceCheckUtils]: 77: Hoare triple {63096#false} assume 0 == assert_~arg#1 % 256; {63096#false} is VALID [2022-02-20 19:48:21,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {63096#false} assume !false; {63096#false} is VALID [2022-02-20 19:48:21,694 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 19:48:21,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:21,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459056487] [2022-02-20 19:48:21,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459056487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:21,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:21,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:21,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886967961] [2022-02-20 19:48:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:21,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:21,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:21,751 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 19:48:21,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:21,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:21,752 INFO L87 Difference]: Start difference. First operand 2169 states and 3423 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:24,263 INFO L93 Difference]: Finished difference Result 3329 states and 5217 transitions. [2022-02-20 19:48:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:24,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:48:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:48:24,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:48:25,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:25,843 INFO L225 Difference]: With dead ends: 3329 [2022-02-20 19:48:25,843 INFO L226 Difference]: Without dead ends: 2713 [2022-02-20 19:48:25,844 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 19:48:25,844 INFO L933 BasicCegarLoop]: 1617 mSDtfsCounter, 1508 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1726 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 19:48:25,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1508 Valid, 1726 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-02-20 19:48:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2022-02-20 19:48:26,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:26,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,553 INFO L74 IsIncluded]: Start isIncluded. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,556 INFO L87 Difference]: Start difference. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,741 INFO L93 Difference]: Finished difference Result 2713 states and 4248 transitions. [2022-02-20 19:48:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4248 transitions. [2022-02-20 19:48:26,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 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 2713 states. [2022-02-20 19:48:26,748 INFO L87 Difference]: Start difference. First operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 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 2713 states. [2022-02-20 19:48:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,951 INFO L93 Difference]: Finished difference Result 2713 states and 4248 transitions. [2022-02-20 19:48:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4248 transitions. [2022-02-20 19:48:26,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:26,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2709 states have (on average 1.567737172388335) internal successors, (4247), 2710 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:48:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4247 transitions. [2022-02-20 19:48:27,157 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4247 transitions. Word has length 79 [2022-02-20 19:48:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:27,158 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 4247 transitions. [2022-02-20 19:48:27,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4247 transitions. [2022-02-20 19:48:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:48:27,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:27,158 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 19:48:27,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:48:27,159 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash -111995272, now seen corresponding path program 1 times [2022-02-20 19:48:27,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:27,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086746869] [2022-02-20 19:48:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {75120#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(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {75120#true} is VALID [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {75120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {75120#true} is VALID [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {75120#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {75120#true} is VALID [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {75120#true} assume 0 == ~r1~0; {75120#true} is VALID [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {75120#true} assume ~id1~0 >= 0; {75120#true} is VALID [2022-02-20 19:48:27,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {75120#true} assume 0 == ~st1~0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {75120#true} assume ~send1~0 == ~id1~0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {75120#true} assume 0 == ~mode1~0 % 256; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {75120#true} assume ~id2~0 >= 0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {75120#true} assume 0 == ~st2~0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {75120#true} assume ~send2~0 == ~id2~0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {75120#true} assume 0 == ~mode2~0 % 256; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {75120#true} assume ~id3~0 >= 0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {75120#true} assume 0 == ~st3~0; {75120#true} is VALID [2022-02-20 19:48:27,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {75120#true} assume ~send3~0 == ~id3~0; {75120#true} is VALID [2022-02-20 19:48:27,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {75120#true} assume 0 == ~mode3~0 % 256; {75120#true} is VALID [2022-02-20 19:48:27,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {75120#true} assume ~id4~0 >= 0; {75120#true} is VALID [2022-02-20 19:48:27,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {75120#true} assume 0 == ~st4~0; {75120#true} is VALID [2022-02-20 19:48:27,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {75120#true} assume ~send4~0 == ~id4~0; {75120#true} is VALID [2022-02-20 19:48:27,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {75120#true} assume 0 == ~mode4~0 % 256; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;main1_~i2~0#1 := 0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {75122#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {75121#false} assume node4_~m4~0#1 != ~nomsg~0; {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {75121#false} assume !(node4_~m4~0#1 > ~id4~0); {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {75121#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {75121#false} ~mode4~0 := 0; {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {75121#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {75121#false} assume !(0 != ~mode5~0 % 256); {75121#false} is VALID [2022-02-20 19:48:27,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {75121#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {75121#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {75121#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {75121#false} assume !(0 != ~mode6~0 % 256); {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {75121#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {75121#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {75121#false} assume { :end_inline_node6 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {75121#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {75121#false} is VALID [2022-02-20 19:48:27,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {75121#false} check_#res#1 := check_~tmp~1#1; {75121#false} is VALID [2022-02-20 19:48:27,218 INFO L290 TraceCheckUtils]: 76: Hoare triple {75121#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {75121#false} is VALID [2022-02-20 19:48:27,218 INFO L290 TraceCheckUtils]: 77: Hoare triple {75121#false} assume 0 == assert_~arg#1 % 256; {75121#false} is VALID [2022-02-20 19:48:27,218 INFO L290 TraceCheckUtils]: 78: Hoare triple {75121#false} assume !false; {75121#false} is VALID [2022-02-20 19:48:27,218 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 19:48:27,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:27,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086746869] [2022-02-20 19:48:27,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086746869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:27,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:27,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:27,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185382255] [2022-02-20 19:48:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:27,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:27,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 19:48:27,266 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 19:48:27,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:27,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:27,267 INFO L87 Difference]: Start difference. First operand 2711 states and 4247 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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)