./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label03.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_label03.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 ecdc1df8791622fbe3f4dcfbea3b27b9095dd3e12c90083fff586730bc575daa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:46:55,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:46:55,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:46:55,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:46:55,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:46:55,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:46:55,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:46:55,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:46:55,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:46:55,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:46:55,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:46:55,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:46:55,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:46:55,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:46:55,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:46:55,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:46:55,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:46:55,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:46:55,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:46:55,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:46:55,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:46:55,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:46:55,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:46:55,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:46:55,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:46:55,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:46:55,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:46:55,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:46:55,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:46:55,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:46:55,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:46:55,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:46:55,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:46:55,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:46:55,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:46:55,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:46:55,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:46:55,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:46:55,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:46:55,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:46:55,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:46:55,101 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:46:55,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:46:55,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:46:55,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:46:55,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:46:55,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:46:55,123 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:46:55,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:46:55,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:46:55,124 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:46:55,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:46:55,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:46:55,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:46:55,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:46:55,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:46:55,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:46:55,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:46:55,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:46:55,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:46:55,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:46:55,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:46:55,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:46:55,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:46:55,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:46:55,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:46:55,129 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:46:55,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:46:55,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:46:55,130 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 -> ecdc1df8791622fbe3f4dcfbea3b27b9095dd3e12c90083fff586730bc575daa [2022-02-20 19:46:55,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:46:55,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:46:55,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:46:55,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:46:55,334 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:46:55,335 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_label03.c [2022-02-20 19:46:55,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd478d0/1f8fddd54fb14395972f1746c47cd8a8/FLAG85631f064 [2022-02-20 19:46:55,932 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:46:55,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label03.c [2022-02-20 19:46:55,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd478d0/1f8fddd54fb14395972f1746c47cd8a8/FLAG85631f064 [2022-02-20 19:46:56,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92cd478d0/1f8fddd54fb14395972f1746c47cd8a8 [2022-02-20 19:46:56,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:46:56,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:46:56,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:46:56,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:46:56,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:46:56,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:46:56" (1/1) ... [2022-02-20 19:46:56,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc03dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:56, skipping insertion in model container [2022-02-20 19:46:56,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:46:56" (1/1) ... [2022-02-20 19:46:56,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:46:56,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:46:56,799 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_label03.c[15482,15495] [2022-02-20 19:46:56,814 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_label03.c[17819,17832] [2022-02-20 19:46:57,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:46:57,337 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:46:57,379 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_label03.c[15482,15495] [2022-02-20 19:46:57,384 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_label03.c[17819,17832] [2022-02-20 19:46:57,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:46:57,815 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:46:57,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57 WrapperNode [2022-02-20 19:46:57,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:46:57,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:46:57,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:46:57,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:46:57,823 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:46:57" (1/1) ... [2022-02-20 19:46:57,860 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:46:57" (1/1) ... [2022-02-20 19:46:58,199 INFO L137 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2022-02-20 19:46:58,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:46:58,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:46:58,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:46:58,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:46:58,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:46:58,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:46:58,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:46:58,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:46:58,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (1/1) ... [2022-02-20 19:46:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:46:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:46:58,494 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:46:58,499 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:46:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:46:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:46:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:46:58,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:46:58,598 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:46:58,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:47:04,823 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:47:04,835 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:47:04,835 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:47:04,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:04 BoogieIcfgContainer [2022-02-20 19:47:04,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:47:04,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:47:04,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:47:04,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:47:04,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:46:56" (1/3) ... [2022-02-20 19:47:04,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfdb243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:04, skipping insertion in model container [2022-02-20 19:47:04,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:57" (2/3) ... [2022-02-20 19:47:04,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfdb243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:04, skipping insertion in model container [2022-02-20 19:47:04,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:04" (3/3) ... [2022-02-20 19:47:04,847 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label03.c [2022-02-20 19:47:04,850 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:47:04,850 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:47:04,891 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:47:04,903 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:04,903 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:47:04,934 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:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 19:47:04,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:04,939 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] [2022-02-20 19:47:04,940 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2133274203, now seen corresponding path program 1 times [2022-02-20 19:47:04,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:04,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729144848] [2022-02-20 19:47:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:05,161 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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {931#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {931#(<= 4 ~a5~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#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {931#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {931#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {931#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:47:05,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {931#(<= 4 ~a5~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {930#false} is VALID [2022-02-20 19:47:05,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-02-20 19:47:05,174 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:05,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:05,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729144848] [2022-02-20 19:47:05,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729144848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:05,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:05,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:05,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767408628] [2022-02-20 19:47:05,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:05,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:47:05,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:05,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:05,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:05,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:05,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:05,228 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:10,574 INFO L93 Difference]: Finished difference Result 2561 states and 4920 transitions. [2022-02-20 19:47:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 19:47:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4920 transitions. [2022-02-20 19:47:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4920 transitions. [2022-02-20 19:47:10,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4920 transitions. [2022-02-20 19:47:14,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4920 edges. 4920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:14,201 INFO L225 Difference]: With dead ends: 2561 [2022-02-20 19:47:14,201 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:47:14,208 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:14,210 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1062 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:14,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 342 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:47:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:47:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:47:14,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:14,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:14,301 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:14,383 INFO L93 Difference]: Finished difference Result 1611 states and 2959 transitions. [2022-02-20 19:47:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:47:14,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:14,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:14,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 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:14,394 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 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:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:14,473 INFO L93 Difference]: Finished difference Result 1611 states and 2959 transitions. [2022-02-20 19:47:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:47:14,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:14,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:14,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:14,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2959 transitions. [2022-02-20 19:47:14,565 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2959 transitions. Word has length 20 [2022-02-20 19:47:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:14,566 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2959 transitions. [2022-02-20 19:47:14,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:47:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:14,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:14,570 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:14,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:47:14,570 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 615382892, now seen corresponding path program 1 times [2022-02-20 19:47:14,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:14,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683490507] [2022-02-20 19:47:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:14,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#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; {8387#true} is VALID [2022-02-20 19:47:14,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {8387#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; {8387#true} is VALID [2022-02-20 19:47:14,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {8387#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; {8387#true} is VALID [2022-02-20 19:47:14,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {8387#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8389#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:47:14,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {8389#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8390#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:47:14,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {8390#(= |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; {8391#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:47:14,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {8391#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8388#false} is VALID [2022-02-20 19:47:14,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {8388#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {8388#false} ~mode1~0 := 0; {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {8388#false} assume !(0 != ~mode2~0 % 256); {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {8388#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {8388#false} assume !(0 != ~mode3~0 % 256); {8388#false} is VALID [2022-02-20 19:47:14,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {8388#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8388#false} is VALID [2022-02-20 19:47:14,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {8388#false} assume !(0 != ~mode4~0 % 256); {8388#false} is VALID [2022-02-20 19:47:14,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {8388#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8388#false} is VALID [2022-02-20 19:47:14,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {8388#false} assume !(0 != ~mode5~0 % 256); {8388#false} is VALID [2022-02-20 19:47:14,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {8388#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8388#false} is VALID [2022-02-20 19:47:14,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {8388#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8388#false} is VALID [2022-02-20 19:47:14,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {8388#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8388#false} is VALID [2022-02-20 19:47:14,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {8388#false} ~mode6~0 := 0; {8388#false} is VALID [2022-02-20 19:47:14,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {8388#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {8388#false} is VALID [2022-02-20 19:47:14,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {8388#false} check_#res#1 := check_~tmp~1#1; {8388#false} is VALID [2022-02-20 19:47:14,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:47:14,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {8388#false} assume 0 == assert_~arg#1 % 256; {8388#false} is VALID [2022-02-20 19:47:14,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {8388#false} assume !false; {8388#false} is VALID [2022-02-20 19:47:14,690 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:14,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:14,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683490507] [2022-02-20 19:47:14,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683490507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:14,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:14,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:47:14,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577478949] [2022-02-20 19:47:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:14,692 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:14,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:14,693 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:14,718 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:14,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:47:14,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:14,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:47:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:14,720 INFO L87 Difference]: Start difference. First operand 1611 states and 2959 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:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:18,482 INFO L93 Difference]: Finished difference Result 1675 states and 3058 transitions. [2022-02-20 19:47:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:18,482 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:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:18,482 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:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:18,489 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:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:18,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1719 transitions. [2022-02-20 19:47:19,725 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:19,799 INFO L225 Difference]: With dead ends: 1675 [2022-02-20 19:47:19,799 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:47:19,799 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:19,800 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:19,801 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:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:47:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:47:19,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:19,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:19,829 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:19,831 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:19,905 INFO L93 Difference]: Finished difference Result 1611 states and 2919 transitions. [2022-02-20 19:47:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:19,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:19,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:19,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 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:19,912 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 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:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:19,993 INFO L93 Difference]: Finished difference Result 1611 states and 2919 transitions. [2022-02-20 19:47:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:19,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:19,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:19,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:19,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2919 transitions. [2022-02-20 19:47:20,074 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2919 transitions. Word has length 38 [2022-02-20 19:47:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:20,074 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2919 transitions. [2022-02-20 19:47:20,075 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:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:20,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:20,077 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:20,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:20,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:20,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2101054792, now seen corresponding path program 1 times [2022-02-20 19:47:20,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:20,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312825854] [2022-02-20 19:47:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:20,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {14956#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; {14956#true} is VALID [2022-02-20 19:47:20,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {14956#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; {14956#true} is VALID [2022-02-20 19:47:20,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {14956#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; {14956#true} is VALID [2022-02-20 19:47:20,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {14956#true} assume 0 == ~r1~0; {14956#true} is VALID [2022-02-20 19:47:20,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {14956#true} assume ~id1~0 >= 0; {14956#true} is VALID [2022-02-20 19:47:20,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {14956#true} assume 0 == ~st1~0; {14956#true} is VALID [2022-02-20 19:47:20,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {14956#true} assume ~send1~0 == ~id1~0; {14956#true} is VALID [2022-02-20 19:47:20,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {14956#true} assume 0 == ~mode1~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {14958#(= (+ (* (- 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; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {14958#(= (+ (* (- 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; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {14958#(= (+ (* (- 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; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:20,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {14958#(= (+ (* (- 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; {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {14957#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {14957#false} ~mode1~0 := 0; {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {14957#false} assume !(0 != ~mode2~0 % 256); {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {14957#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14957#false} is VALID [2022-02-20 19:47:20,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {14957#false} assume !(0 != ~mode3~0 % 256); {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {14957#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {14957#false} assume !(0 != ~mode4~0 % 256); {14957#false} is VALID [2022-02-20 19:47:20,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {14957#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {14957#false} assume !(0 != ~mode5~0 % 256); {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {14957#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {14957#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {14957#false} assume !(node6_~m6~0#1 != ~nomsg~0); {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {14957#false} ~mode6~0 := 0; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {14957#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {14957#false} check_#res#1 := check_~tmp~1#1; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:20,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {14957#false} assume 0 == assert_~arg#1 % 256; {14957#false} is VALID [2022-02-20 19:47:20,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {14957#false} assume !false; {14957#false} is VALID [2022-02-20 19:47:20,209 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:20,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:20,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312825854] [2022-02-20 19:47:20,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312825854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:20,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:20,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:20,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157565331] [2022-02-20 19:47:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:20,211 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:20,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:20,211 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:20,262 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:20,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:20,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:20,263 INFO L87 Difference]: Start difference. First operand 1611 states and 2919 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:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:21,994 INFO L93 Difference]: Finished difference Result 1725 states and 3099 transitions. [2022-02-20 19:47:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:21,995 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:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:21,995 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:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:22,005 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:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:22,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:23,393 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:23,465 INFO L225 Difference]: With dead ends: 1725 [2022-02-20 19:47:23,465 INFO L226 Difference]: Without dead ends: 1665 [2022-02-20 19:47:23,466 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:23,469 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:23,469 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:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-02-20 19:47:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1663. [2022-02-20 19:47:23,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:23,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:23,503 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:23,505 INFO L87 Difference]: Start difference. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:23,591 INFO L93 Difference]: Finished difference Result 1665 states and 3003 transitions. [2022-02-20 19:47:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3003 transitions. [2022-02-20 19:47:23,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:23,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:23,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 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:23,598 INFO L87 Difference]: Start difference. First operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 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:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:23,715 INFO L93 Difference]: Finished difference Result 1665 states and 3003 transitions. [2022-02-20 19:47:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3003 transitions. [2022-02-20 19:47:23,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:23,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:23,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:23,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3002 transitions. [2022-02-20 19:47:23,813 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3002 transitions. Word has length 77 [2022-02-20 19:47:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:23,814 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 3002 transitions. [2022-02-20 19:47:23,814 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:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3002 transitions. [2022-02-20 19:47:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:23,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:23,815 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:23,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:47:23,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1452480302, now seen corresponding path program 1 times [2022-02-20 19:47:23,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:23,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158861133] [2022-02-20 19:47:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:23,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {21746#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; {21746#true} is VALID [2022-02-20 19:47:23,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {21746#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; {21746#true} is VALID [2022-02-20 19:47:23,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {21746#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; {21746#true} is VALID [2022-02-20 19:47:23,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {21746#true} assume 0 == ~r1~0; {21746#true} is VALID [2022-02-20 19:47:23,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {21746#true} assume ~id1~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {21746#true} assume 0 == ~st1~0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {21746#true} assume ~send1~0 == ~id1~0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {21746#true} assume 0 == ~mode1~0 % 256; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {21746#true} assume ~id2~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {21746#true} assume 0 == ~st2~0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {21746#true} assume ~send2~0 == ~id2~0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {21746#true} assume 0 == ~mode2~0 % 256; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {21746#true} assume ~id3~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {21746#true} assume 0 == ~st3~0; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {21746#true} assume ~send3~0 == ~id3~0; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {21746#true} assume 0 == ~mode3~0 % 256; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {21746#true} assume ~id4~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {21746#true} assume 0 == ~st4~0; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {21746#true} assume ~send4~0 == ~id4~0; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {21746#true} assume 0 == ~mode4~0 % 256; {21746#true} is VALID [2022-02-20 19:47:23,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {21746#true} assume ~id5~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {21746#true} assume 0 == ~st5~0; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {21746#true} assume ~send5~0 == ~id5~0; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {21746#true} assume 0 == ~mode5~0 % 256; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {21746#true} assume ~id6~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {21746#true} assume 0 == ~st6~0; {21746#true} is VALID [2022-02-20 19:47:23,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {21746#true} assume ~send6~0 == ~id6~0; {21746#true} is VALID [2022-02-20 19:47:23,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {21746#true} assume 0 == ~mode6~0 % 256; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,926 INFO L290 TraceCheckUtils]: 48: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,926 INFO L290 TraceCheckUtils]: 49: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,926 INFO L290 TraceCheckUtils]: 50: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,930 INFO L290 TraceCheckUtils]: 59: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,930 INFO L290 TraceCheckUtils]: 60: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,930 INFO L290 TraceCheckUtils]: 61: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,931 INFO L290 TraceCheckUtils]: 63: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,931 INFO L290 TraceCheckUtils]: 64: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:23,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {21748#(= (+ (* (- 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; {21747#false} is VALID [2022-02-20 19:47:23,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {21747#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21747#false} is VALID [2022-02-20 19:47:23,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {21747#false} ~mode6~0 := 0; {21747#false} is VALID [2022-02-20 19:47:23,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {21747#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; {21747#false} is VALID [2022-02-20 19:47:23,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {21747#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {21747#false} is VALID [2022-02-20 19:47:23,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {21747#false} check_#res#1 := check_~tmp~1#1; {21747#false} is VALID [2022-02-20 19:47:23,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {21747#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; {21747#false} is VALID [2022-02-20 19:47:23,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {21747#false} assume 0 == assert_~arg#1 % 256; {21747#false} is VALID [2022-02-20 19:47:23,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {21747#false} assume !false; {21747#false} is VALID [2022-02-20 19:47:23,934 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:23,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:23,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158861133] [2022-02-20 19:47:23,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158861133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:23,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:23,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:23,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621205664] [2022-02-20 19:47:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:23,936 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:23,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:23,936 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:23,981 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:23,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:23,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:23,982 INFO L87 Difference]: Start difference. First operand 1663 states and 3002 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:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:25,734 INFO L93 Difference]: Finished difference Result 1875 states and 3338 transitions. [2022-02-20 19:47:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:25,734 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:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:25,735 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:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:25,741 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:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:25,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:27,089 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:27,169 INFO L225 Difference]: With dead ends: 1875 [2022-02-20 19:47:27,170 INFO L226 Difference]: Without dead ends: 1763 [2022-02-20 19:47:27,170 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:27,173 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:27,173 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:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-02-20 19:47:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1761. [2022-02-20 19:47:27,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:27,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:27,215 INFO L74 IsIncluded]: Start isIncluded. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:27,216 INFO L87 Difference]: Start difference. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:27,300 INFO L93 Difference]: Finished difference Result 1763 states and 3158 transitions. [2022-02-20 19:47:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 3158 transitions. [2022-02-20 19:47:27,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:27,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:27,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 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:47:27,307 INFO L87 Difference]: Start difference. First operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 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:47:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:27,396 INFO L93 Difference]: Finished difference Result 1763 states and 3158 transitions. [2022-02-20 19:47:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 3158 transitions. [2022-02-20 19:47:27,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:27,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:27,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:27,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 3157 transitions. [2022-02-20 19:47:27,488 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 3157 transitions. Word has length 77 [2022-02-20 19:47:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:27,488 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 3157 transitions. [2022-02-20 19:47:27,489 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:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 3157 transitions. [2022-02-20 19:47:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:27,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:27,489 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:27,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:47:27,490 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1624501596, now seen corresponding path program 1 times [2022-02-20 19:47:27,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:27,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417598656] [2022-02-20 19:47:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:27,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {29025#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; {29025#true} is VALID [2022-02-20 19:47:27,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {29025#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; {29025#true} is VALID [2022-02-20 19:47:27,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {29025#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; {29025#true} is VALID [2022-02-20 19:47:27,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {29025#true} assume 0 == ~r1~0; {29025#true} is VALID [2022-02-20 19:47:27,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {29025#true} assume ~id1~0 >= 0; {29025#true} is VALID [2022-02-20 19:47:27,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {29025#true} assume 0 == ~st1~0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:27,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {29027#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:27,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {29027#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:27,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {29027#(<= ~st1~0 0)} assume ~id2~0 >= 0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:27,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {29027#(<= ~st1~0 0)} assume 0 == ~st2~0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:27,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,593 INFO L290 TraceCheckUtils]: 51: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {29032#(<= (+ ~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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:27,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {29032#(<= (+ ~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; {29026#false} is VALID [2022-02-20 19:47:27,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {29026#false} check_#res#1 := check_~tmp~1#1; {29026#false} is VALID [2022-02-20 19:47:27,601 INFO L290 TraceCheckUtils]: 74: Hoare triple {29026#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; {29026#false} is VALID [2022-02-20 19:47:27,601 INFO L290 TraceCheckUtils]: 75: Hoare triple {29026#false} assume 0 == assert_~arg#1 % 256; {29026#false} is VALID [2022-02-20 19:47:27,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {29026#false} assume !false; {29026#false} is VALID [2022-02-20 19:47:27,601 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:27,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:27,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417598656] [2022-02-20 19:47:27,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417598656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:27,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:27,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:27,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56304174] [2022-02-20 19:47:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:27,602 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:47:27,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:27,603 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:47:27,660 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:27,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:27,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:27,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:27,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:27,661 INFO L87 Difference]: Start difference. First operand 1761 states and 3157 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:47:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:33,509 INFO L93 Difference]: Finished difference Result 4281 states and 7153 transitions. [2022-02-20 19:47:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 19:47:33,510 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:47:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:33,510 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:47:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:33,518 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:47:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:33,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 2720 transitions. [2022-02-20 19:47:35,604 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:47:36,078 INFO L225 Difference]: With dead ends: 4281 [2022-02-20 19:47:36,078 INFO L226 Difference]: Without dead ends: 4071 [2022-02-20 19:47:36,079 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:47:36,079 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:47:36,079 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:47:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-02-20 19:47:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 1969. [2022-02-20 19:47:36,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:36,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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,315 INFO L74 IsIncluded]: Start isIncluded. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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,317 INFO L87 Difference]: Start difference. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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 L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:36,802 INFO L93 Difference]: Finished difference Result 4071 states and 6772 transitions. [2022-02-20 19:47:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6772 transitions. [2022-02-20 19:47:36,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:36,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:36,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 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:47:36,813 INFO L87 Difference]: Start difference. First operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 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:47:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:37,295 INFO L93 Difference]: Finished difference Result 4071 states and 6772 transitions. [2022-02-20 19:47:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6772 transitions. [2022-02-20 19:47:37,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:37,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:37,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:37,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3481 transitions. [2022-02-20 19:47:37,411 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3481 transitions. Word has length 77 [2022-02-20 19:47:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:37,411 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 3481 transitions. [2022-02-20 19:47:37,412 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:47:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3481 transitions. [2022-02-20 19:47:37,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:37,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:37,412 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:47:37,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:47:37,413 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 806369108, now seen corresponding path program 1 times [2022-02-20 19:47:37,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:37,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071271822] [2022-02-20 19:47:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:37,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {44008#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; {44008#true} is VALID [2022-02-20 19:47:37,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {44008#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; {44008#true} is VALID [2022-02-20 19:47:37,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {44008#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; {44008#true} is VALID [2022-02-20 19:47:37,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {44008#true} assume 0 == ~r1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {44010#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {44010#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {44010#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {44010#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {44010#(<= ~r1~0 0)} assume ~id5~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {44010#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {44010#(<= ~r1~0 0)} assume ~id6~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {44010#(<= ~r1~0 0)} assume ~send6~0 == ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode6~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {44010#(<= ~r1~0 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {44010#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {44010#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,493 INFO L290 TraceCheckUtils]: 52: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {44010#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {44010#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {44010#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,497 INFO L290 TraceCheckUtils]: 65: Hoare triple {44010#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode6~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {44010#(<= ~r1~0 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {44010#(<= ~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {44010#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {44010#(<= ~r1~0 0)} assume ~r1~0 >= 6; {44009#false} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {44009#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {44009#false} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {44009#false} check_#res#1 := check_~tmp~1#1; {44009#false} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {44009#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; {44009#false} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {44009#false} assume 0 == assert_~arg#1 % 256; {44009#false} is VALID [2022-02-20 19:47:37,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {44009#false} assume !false; {44009#false} is VALID [2022-02-20 19:47:37,500 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,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:37,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071271822] [2022-02-20 19:47:37,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071271822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:37,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:37,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:37,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112884140] [2022-02-20 19:47:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:37,501 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:47:37,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:37,501 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:47:37,543 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:47:37,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:37,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:37,544 INFO L87 Difference]: Start difference. First operand 1969 states and 3481 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:47:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:39,224 INFO L93 Difference]: Finished difference Result 2589 states and 4453 transitions. [2022-02-20 19:47:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:39,225 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:47:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:39,225 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:47:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:39,231 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:47:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:39,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1761 transitions. [2022-02-20 19:47:40,470 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:47:40,592 INFO L225 Difference]: With dead ends: 2589 [2022-02-20 19:47:40,592 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 19:47:40,593 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:40,594 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:47:40,594 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:47:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 19:47:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 19:47:40,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:40,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:40,931 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:40,932 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:41,055 INFO L93 Difference]: Finished difference Result 2171 states and 3790 transitions. [2022-02-20 19:47:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3790 transitions. [2022-02-20 19:47:41,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:41,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:41,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 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:47:41,061 INFO L87 Difference]: Start difference. First operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 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:47:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:41,182 INFO L93 Difference]: Finished difference Result 2171 states and 3790 transitions. [2022-02-20 19:47:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3790 transitions. [2022-02-20 19:47:41,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:41,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:41,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:41,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3789 transitions. [2022-02-20 19:47:41,317 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3789 transitions. Word has length 79 [2022-02-20 19:47:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:41,317 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3789 transitions. [2022-02-20 19:47:41,318 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:47:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3789 transitions. [2022-02-20 19:47:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:41,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:41,318 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:47:41,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:47:41,319 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 872862620, now seen corresponding path program 1 times [2022-02-20 19:47:41,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:41,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959979831] [2022-02-20 19:47:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:41,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {53421#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; {53421#true} is VALID [2022-02-20 19:47:41,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {53421#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; {53421#true} is VALID [2022-02-20 19:47:41,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {53421#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; {53421#true} is VALID [2022-02-20 19:47:41,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {53421#true} assume 0 == ~r1~0; {53421#true} is VALID [2022-02-20 19:47:41,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {53421#true} assume ~id1~0 >= 0; {53421#true} is VALID [2022-02-20 19:47:41,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {53421#true} assume 0 == ~st1~0; {53423#(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:47:41,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {53423#(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; {53423#(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:47:41,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {53423#(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; {53423#(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:47:41,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {53423#(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; {53423#(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:47:41,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {53423#(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; {53424#(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:47:41,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {53424#(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; {53424#(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:47:41,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {53424#(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; {53424#(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:47:41,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {53424#(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; {53424#(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:47:41,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {53424#(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; {53425#(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:47:41,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {53425#(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; {53425#(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:47:41,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {53425#(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; {53425#(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:47:41,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {53425#(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; {53425#(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:47:41,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {53425#(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; {53426#(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:47:41,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {53426#(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; {53426#(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:47:41,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {53426#(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; {53426#(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:47:41,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {53426#(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; {53426#(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:47:41,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {53426#(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; {53427#(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:47:41,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {53427#(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; {53427#(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:47:41,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {53427#(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; {53427#(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:47:41,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {53427#(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; {53427#(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:47:41,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {53427#(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; {53428#(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:47:41,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {53428#(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; {53428#(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:47:41,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {53428#(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; {53428#(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:47:41,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {53428#(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; {53428#(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:47:41,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {53428#(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; {53428#(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:47:41,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {53428#(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; {53428#(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:47:41,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {53428#(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; {53428#(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:47:41,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {53428#(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; {53428#(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:47:41,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {53428#(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; {53428#(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:47:41,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {53428#(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; {53428#(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:47:41,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {53428#(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; {53428#(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:47:41,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {53428#(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; {53428#(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:47:41,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {53428#(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; {53428#(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:47:41,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {53428#(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; {53428#(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:47:41,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {53428#(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; {53428#(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:47:41,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {53428#(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; {53428#(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:47:41,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {53428#(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; {53428#(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:47:41,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {53428#(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; {53428#(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:47:41,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {53428#(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; {53428#(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:47:41,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {53428#(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; {53428#(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:47:41,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {53428#(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); {53428#(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:47:41,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {53428#(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; {53428#(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:47:41,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {53428#(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; {53428#(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:47:41,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {53428#(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); {53428#(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:47:41,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {53428#(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; {53428#(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:47:41,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {53428#(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; {53428#(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:47:41,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {53428#(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; {53428#(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:47:41,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {53428#(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); {53428#(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:47:41,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {53428#(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; {53428#(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:47:41,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {53428#(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; {53428#(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:47:41,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {53428#(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; {53428#(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:47:41,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {53428#(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); {53428#(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:47:41,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {53428#(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; {53428#(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:47:41,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {53428#(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; {53428#(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:47:41,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {53428#(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; {53428#(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:47:41,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {53428#(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); {53428#(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:47:41,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {53428#(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; {53428#(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:47:41,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {53428#(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; {53428#(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:47:41,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {53428#(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; {53428#(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:47:41,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {53428#(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); {53428#(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:47:41,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {53428#(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; {53428#(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:47:41,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {53428#(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; {53428#(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:47:41,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {53428#(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; {53428#(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:47:41,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {53428#(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); {53428#(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:47:41,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {53428#(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; {53428#(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:47:41,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {53428#(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; {53428#(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:47:41,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {53428#(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; {53428#(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:47:41,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {53428#(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; {53428#(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:47:41,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {53428#(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); {53428#(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:47:41,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {53428#(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; {53422#false} is VALID [2022-02-20 19:47:41,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {53422#false} check_#res#1 := check_~tmp~1#1; {53422#false} is VALID [2022-02-20 19:47:41,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {53422#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; {53422#false} is VALID [2022-02-20 19:47:41,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {53422#false} assume 0 == assert_~arg#1 % 256; {53422#false} is VALID [2022-02-20 19:47:41,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {53422#false} assume !false; {53422#false} is VALID [2022-02-20 19:47:41,554 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:41,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:41,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959979831] [2022-02-20 19:47:41,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959979831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:41,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:41,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:41,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188677514] [2022-02-20 19:47:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:41,555 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:47:41,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:41,556 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:47:41,608 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:47:41,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:41,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:41,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:41,609 INFO L87 Difference]: Start difference. First operand 2169 states and 3789 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:47:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:46,797 INFO L93 Difference]: Finished difference Result 2787 states and 4753 transitions. [2022-02-20 19:47:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:47:46,797 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:47:46,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:46,797 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:47:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1768 transitions. [2022-02-20 19:47:46,803 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:47:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1768 transitions. [2022-02-20 19:47:46,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1768 transitions. [2022-02-20 19:47:48,201 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:47:48,322 INFO L225 Difference]: With dead ends: 2787 [2022-02-20 19:47:48,322 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 19:47:48,323 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:47:48,324 INFO L933 BasicCegarLoop]: 1597 mSDtfsCounter, 7775 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7775 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:48,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7775 Valid, 2058 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:47:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 19:47:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 19:47:48,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:48,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have 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:48,690 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have 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:48,691 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have 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:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:48,811 INFO L93 Difference]: Finished difference Result 2171 states and 3784 transitions. [2022-02-20 19:47:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3784 transitions. [2022-02-20 19:47:48,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:48,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:48,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 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:47:48,817 INFO L87 Difference]: Start difference. First operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 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:47:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:48,937 INFO L93 Difference]: Finished difference Result 2171 states and 3784 transitions. [2022-02-20 19:47:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3784 transitions. [2022-02-20 19:47:48,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:48,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:48,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:48,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.7457314259344716) internal successors, (3783), 2168 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have 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:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3783 transitions. [2022-02-20 19:47:49,073 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3783 transitions. Word has length 79 [2022-02-20 19:47:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:49,073 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3783 transitions. [2022-02-20 19:47:49,073 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:47:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3783 transitions. [2022-02-20 19:47:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:49,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:49,074 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:47:49,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:47:49,074 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash -385682984, now seen corresponding path program 1 times [2022-02-20 19:47:49,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:49,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168177362] [2022-02-20 19:47:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:49,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {63079#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; {63079#true} is VALID [2022-02-20 19:47:49,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {63079#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; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {63079#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; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {63079#true} assume 0 == ~r1~0; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {63079#true} assume ~id1~0 >= 0; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {63079#true} assume 0 == ~st1~0; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {63079#true} assume ~send1~0 == ~id1~0; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {63079#true} assume 0 == ~mode1~0 % 256; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {63079#true} assume ~id2~0 >= 0; {63079#true} is VALID [2022-02-20 19:47:49,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {63079#true} assume 0 == ~st2~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {63079#true} assume ~send2~0 == ~id2~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {63079#true} assume 0 == ~mode2~0 % 256; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {63079#true} assume ~id3~0 >= 0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {63079#true} assume 0 == ~st3~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {63079#true} assume ~send3~0 == ~id3~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {63079#true} assume 0 == ~mode3~0 % 256; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {63079#true} assume ~id4~0 >= 0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {63079#true} assume 0 == ~st4~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {63079#true} assume ~send4~0 == ~id4~0; {63079#true} is VALID [2022-02-20 19:47:49,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {63079#true} assume 0 == ~mode4~0 % 256; {63079#true} is VALID [2022-02-20 19:47:49,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {63079#true} assume ~id5~0 >= 0; {63079#true} is VALID [2022-02-20 19:47:49,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {63079#true} assume 0 == ~st5~0; {63079#true} is VALID [2022-02-20 19:47:49,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {63079#true} assume ~send5~0 == ~id5~0; {63079#true} is VALID [2022-02-20 19:47:49,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {63079#true} assume 0 == ~mode5~0 % 256; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,143 INFO L290 TraceCheckUtils]: 50: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,144 INFO L290 TraceCheckUtils]: 52: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {63081#(= (+ (* (- 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; {63081#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:47:49,148 INFO L290 TraceCheckUtils]: 64: Hoare triple {63081#(= (+ (* (- 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; {63080#false} is VALID [2022-02-20 19:47:49,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {63080#false} assume node5_~m5~0#1 != ~nomsg~0; {63080#false} is VALID [2022-02-20 19:47:49,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {63080#false} assume !(node5_~m5~0#1 > ~id5~0); {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {63080#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {63080#false} ~mode5~0 := 0; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {63080#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; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {63080#false} assume !(0 != ~mode6~0 % 256); {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 71: Hoare triple {63080#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {63080#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; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 73: Hoare triple {63080#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; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 74: Hoare triple {63080#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 75: Hoare triple {63080#false} check_#res#1 := check_~tmp~1#1; {63080#false} is VALID [2022-02-20 19:47:49,149 INFO L290 TraceCheckUtils]: 76: Hoare triple {63080#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; {63080#false} is VALID [2022-02-20 19:47:49,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {63080#false} assume 0 == assert_~arg#1 % 256; {63080#false} is VALID [2022-02-20 19:47:49,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {63080#false} assume !false; {63080#false} is VALID [2022-02-20 19:47:49,150 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:49,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:49,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168177362] [2022-02-20 19:47:49,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168177362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:49,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:49,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:49,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26073450] [2022-02-20 19:47:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:49,151 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:47:49,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:49,152 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:47:49,215 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:47:49,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:49,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:49,216 INFO L87 Difference]: Start difference. First operand 2169 states and 3783 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:47:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:51,797 INFO L93 Difference]: Finished difference Result 3329 states and 5577 transitions. [2022-02-20 19:47:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:51,797 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:47:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:51,797 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:47:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:51,802 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:47:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:51,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:53,187 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:53,385 INFO L225 Difference]: With dead ends: 3329 [2022-02-20 19:47:53,385 INFO L226 Difference]: Without dead ends: 2713 [2022-02-20 19:47:53,386 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:53,386 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:47:53,386 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:47:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-02-20 19:47:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2022-02-20 19:47:54,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:54,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have 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,095 INFO L74 IsIncluded]: Start isIncluded. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have 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,096 INFO L87 Difference]: Start difference. First operand 2713 states. Second operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have 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,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:54,278 INFO L93 Difference]: Finished difference Result 2713 states and 4608 transitions. [2022-02-20 19:47:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4608 transitions. [2022-02-20 19:47:54,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:54,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:54,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 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:47:54,284 INFO L87 Difference]: Start difference. First operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 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:47:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:54,467 INFO L93 Difference]: Finished difference Result 2713 states and 4608 transitions. [2022-02-20 19:47:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4608 transitions. [2022-02-20 19:47:54,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:54,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:54,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:54,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2709 states have (on average 1.70062753783684) internal successors, (4607), 2710 states have internal predecessors, (4607), 0 states have call successors, (0), 0 states have 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,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4607 transitions. [2022-02-20 19:47:54,682 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4607 transitions. Word has length 79 [2022-02-20 19:47:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:54,682 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 4607 transitions. [2022-02-20 19:47:54,682 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:47:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4607 transitions. [2022-02-20 19:47:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:54,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:54,683 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:47:54,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:47:54,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:54,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash -111995272, now seen corresponding path program 1 times [2022-02-20 19:47:54,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:54,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538776329] [2022-02-20 19:47:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:54,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:54,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {75104#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; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {75104#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; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {75104#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; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {75104#true} assume 0 == ~r1~0; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {75104#true} assume ~id1~0 >= 0; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {75104#true} assume 0 == ~st1~0; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {75104#true} assume ~send1~0 == ~id1~0; {75104#true} is VALID [2022-02-20 19:47:54,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {75104#true} assume 0 == ~mode1~0 % 256; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {75104#true} assume ~id2~0 >= 0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {75104#true} assume 0 == ~st2~0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {75104#true} assume ~send2~0 == ~id2~0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {75104#true} assume 0 == ~mode2~0 % 256; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {75104#true} assume ~id3~0 >= 0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {75104#true} assume 0 == ~st3~0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {75104#true} assume ~send3~0 == ~id3~0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {75104#true} assume 0 == ~mode3~0 % 256; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {75104#true} assume ~id4~0 >= 0; {75104#true} is VALID [2022-02-20 19:47:54,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {75104#true} assume 0 == ~st4~0; {75104#true} is VALID [2022-02-20 19:47:54,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {75104#true} assume ~send4~0 == ~id4~0; {75104#true} is VALID [2022-02-20 19:47:54,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {75104#true} assume 0 == ~mode4~0 % 256; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {75106#(= (+ (* (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; {75106#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:47:54,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {75106#(= (+ (* (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; {75105#false} is VALID [2022-02-20 19:47:54,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {75105#false} assume node4_~m4~0#1 != ~nomsg~0; {75105#false} is VALID [2022-02-20 19:47:54,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {75105#false} assume !(node4_~m4~0#1 > ~id4~0); {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {75105#false} assume node4_~m4~0#1 == ~id4~0;~st4~0 := 1; {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {75105#false} ~mode4~0 := 0; {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {75105#false} assume !(0 != ~mode5~0 % 256); {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {75105#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 68: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,754 INFO L290 TraceCheckUtils]: 69: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {75105#false} assume !(0 != ~mode6~0 % 256); {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 71: Hoare triple {75105#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {75105#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {75105#false} check_#res#1 := check_~tmp~1#1; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {75105#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; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {75105#false} assume 0 == assert_~arg#1 % 256; {75105#false} is VALID [2022-02-20 19:47:54,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {75105#false} assume !false; {75105#false} is VALID [2022-02-20 19:47:54,756 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:54,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:54,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538776329] [2022-02-20 19:47:54,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538776329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:54,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:54,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:54,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650190430] [2022-02-20 19:47:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:54,757 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:47:54,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:54,758 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:47:54,807 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:47:54,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:54,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:54,808 INFO L87 Difference]: Start difference. First operand 2711 states and 4607 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)