./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.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.8.ufo.UNBOUNDED.pals+Problem12_label01.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 25b17d9846be3bf6d57cc6f8838ab7429415f7d55e2316a61257e7b64e148fac --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:52:58,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:52:58,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:52:58,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:52:58,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:52:58,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:52:58,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:52:58,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:52:58,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:52:58,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:52:58,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:52:58,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:52:58,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:52:58,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:52:58,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:52:58,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:52:58,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:52:58,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:52:58,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:52:58,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:52:58,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:52:58,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:52:58,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:52:58,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:52:58,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:52:58,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:52:58,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:52:58,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:52:58,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:52:58,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:52:58,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:52:58,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:52:58,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:52:58,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:52:58,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:52:58,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:52:58,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:52:58,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:52:58,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:52:58,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:52:58,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:52:58,317 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:52:58,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:52:58,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:52:58,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:52:58,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:52:58,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:52:58,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:52:58,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:52:58,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:52:58,341 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:52:58,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:52:58,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:52:58,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:52:58,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:52:58,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:52:58,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:52:58,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:52:58,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:52:58,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:52:58,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:58,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:52:58,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:52:58,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:52:58,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:52:58,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:52:58,346 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:52:58,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:52:58,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:52:58,346 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 -> 25b17d9846be3bf6d57cc6f8838ab7429415f7d55e2316a61257e7b64e148fac [2022-02-20 19:52:58,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:52:58,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:52:58,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:52:58,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:52:58,579 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:52:58,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:52:58,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2f39138/03da2614c6774cc3a7a858c2c871bf48/FLAG4f2284812 [2022-02-20 19:52:59,233 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:52:59,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:52:59,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2f39138/03da2614c6774cc3a7a858c2c871bf48/FLAG4f2284812 [2022-02-20 19:52:59,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2f39138/03da2614c6774cc3a7a858c2c871bf48 [2022-02-20 19:52:59,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:52:59,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:52:59,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:59,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:52:59,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:52:59,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:59" (1/1) ... [2022-02-20 19:52:59,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466c51ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:59, skipping insertion in model container [2022-02-20 19:52:59,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:59" (1/1) ... [2022-02-20 19:52:59,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:52:59,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:00,091 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.8.ufo.UNBOUNDED.pals+Problem12_label01.c[26888,26901] [2022-02-20 19:53:00,133 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.8.ufo.UNBOUNDED.pals+Problem12_label01.c[32443,32456] [2022-02-20 19:53:00,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:00,752 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:00,796 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.8.ufo.UNBOUNDED.pals+Problem12_label01.c[26888,26901] [2022-02-20 19:53:00,804 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.8.ufo.UNBOUNDED.pals+Problem12_label01.c[32443,32456] [2022-02-20 19:53:01,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:01,141 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:01,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01 WrapperNode [2022-02-20 19:53:01,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:01,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:01,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:01,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:01,147 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:53:01" (1/1) ... [2022-02-20 19:53:01,190 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:53:01" (1/1) ... [2022-02-20 19:53:01,566 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:01,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:01,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:01,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:01,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:01,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:01,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:01,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:01,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:01,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (1/1) ... [2022-02-20 19:53:01,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:01,837 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:53:01,856 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:53:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:01,979 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:01,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:08,806 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:08,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:08,824 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:08,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:08 BoogieIcfgContainer [2022-02-20 19:53:08,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:08,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:08,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:08,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:52:59" (1/3) ... [2022-02-20 19:53:08,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb858b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:08, skipping insertion in model container [2022-02-20 19:53:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:01" (2/3) ... [2022-02-20 19:53:08,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bb858b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:08, skipping insertion in model container [2022-02-20 19:53:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:08" (3/3) ... [2022-02-20 19:53:08,835 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2022-02-20 19:53:08,838 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:08,838 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:08,882 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:08,888 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:53:08,888 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have 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:53:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:08,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:08,927 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] [2022-02-20 19:53:08,927 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -805214309, now seen corresponding path program 1 times [2022-02-20 19:53:08,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:08,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710240421] [2022-02-20 19:53:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:09,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {968#true} is VALID [2022-02-20 19:53:09,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {968#true} is VALID [2022-02-20 19:53:09,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:09,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {968#true} is VALID [2022-02-20 19:53:09,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} init_#res#1 := init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:09,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {968#true} is VALID [2022-02-20 19:53:09,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {969#false} is VALID [2022-02-20 19:53:09,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {969#false} is VALID [2022-02-20 19:53:09,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#false} assume !false;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; {969#false} is VALID [2022-02-20 19:53:09,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#false} assume !(0 != ~mode1~0 % 256); {969#false} is VALID [2022-02-20 19:53:09,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {969#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {969#false} is VALID [2022-02-20 19:53:09,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {969#false} ~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; {969#false} is VALID [2022-02-20 19:53:09,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:09,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {969#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#false} assume !(node2_~m2~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#false} ~mode2~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:09,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#false} assume !(node3_~m3~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#false} ~mode3~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:09,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {969#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {969#false} assume !(node4_~m4~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#false} ~mode4~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:09,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {969#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {969#false} assume !(node5_~m5~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {969#false} ~mode5~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:09,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {969#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {969#false} assume !(node6_~m6~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {969#false} ~mode6~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {969#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {969#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {969#false} assume !(node7_~m7~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {969#false} ~mode7~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {969#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:09,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} assume !(node8_~m8~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:09,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {969#false} ~mode8~0 := 0; {969#false} is VALID [2022-02-20 19:53:09,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:09,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {969#false} is VALID [2022-02-20 19:53:09,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} check_#res#1 := check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:09,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {969#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {969#false} is VALID [2022-02-20 19:53:09,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {969#false} assume 0 == assert_~arg#1 % 256; {969#false} is VALID [2022-02-20 19:53:09,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:09,173 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:53:09,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:09,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710240421] [2022-02-20 19:53:09,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710240421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:09,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:09,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:09,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291972070] [2022-02-20 19:53:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:09,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:09,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:09,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:09,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:53:09,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:53:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:09,251 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 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 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:10,480 INFO L93 Difference]: Finished difference Result 1861 states and 3516 transitions. [2022-02-20 19:53:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:53:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:10,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3516 transitions. [2022-02-20 19:53:13,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3516 edges. 3516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:13,138 INFO L225 Difference]: With dead ends: 1861 [2022-02-20 19:53:13,138 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:13,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:13,145 INFO L933 BasicCegarLoop]: 1755 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:13,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:13,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:13,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:13,193 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:13,194 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:13,226 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:13,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:13,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:13,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:13,234 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:13,262 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:13,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:13,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:13,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:13,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1691 transitions. [2022-02-20 19:53:13,295 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1691 transitions. Word has length 46 [2022-02-20 19:53:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:13,296 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1691 transitions. [2022-02-20 19:53:13,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:13,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:13,297 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] [2022-02-20 19:53:13,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:13,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:13,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:13,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542993417] [2022-02-20 19:53:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:13,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {5583#true} is VALID [2022-02-20 19:53:13,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {5583#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {5583#true} is VALID [2022-02-20 19:53:13,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {5583#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5583#true} is VALID [2022-02-20 19:53:13,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {5583#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:13,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5586#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:13,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {5586#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:13,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5584#false} is VALID [2022-02-20 19:53:13,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5584#false} is VALID [2022-02-20 19:53:13,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#false} assume !false;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; {5584#false} is VALID [2022-02-20 19:53:13,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#false} assume !(0 != ~mode1~0 % 256); {5584#false} is VALID [2022-02-20 19:53:13,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {5584#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5584#false} is VALID [2022-02-20 19:53:13,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#false} ~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; {5584#false} is VALID [2022-02-20 19:53:13,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:13,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#false} ~mode2~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#false} ~mode3~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {5584#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {5584#false} ~mode4~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:13,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {5584#false} ~mode5~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:13,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {5584#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {5584#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {5584#false} ~mode6~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {5584#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {5584#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {5584#false} assume !(node7_~m7~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {5584#false} ~mode7~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {5584#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {5584#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {5584#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {5584#false} ~mode8~0 := 0; {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {5584#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {5584#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5584#false} is VALID [2022-02-20 19:53:13,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {5584#false} check_#res#1 := check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:13,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {5584#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {5584#false} is VALID [2022-02-20 19:53:13,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {5584#false} assume 0 == assert_~arg#1 % 256; {5584#false} is VALID [2022-02-20 19:53:13,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {5584#false} assume !false; {5584#false} is VALID [2022-02-20 19:53:13,405 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:53:13,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:13,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542993417] [2022-02-20 19:53:13,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542993417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:13,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:13,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:13,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746108900] [2022-02-20 19:53:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:13,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:13,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:13,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:13,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:13,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:13,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:13,434 INFO L87 Difference]: Start difference. First operand 899 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:17,277 INFO L93 Difference]: Finished difference Result 981 states and 1819 transitions. [2022-02-20 19:53:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:17,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:18,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:18,631 INFO L225 Difference]: With dead ends: 981 [2022-02-20 19:53:18,631 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:18,634 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:53:18,636 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:18,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:18,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:18,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:18,653 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:18,654 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:18,678 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:18,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:18,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:18,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:18,685 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:18,710 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:18,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:18,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:18,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:18,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1630 transitions. [2022-02-20 19:53:18,741 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1630 transitions. Word has length 46 [2022-02-20 19:53:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:18,741 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1630 transitions. [2022-02-20 19:53:18,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:53:18,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:18,743 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] [2022-02-20 19:53:18,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:18,743 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1418201483, now seen corresponding path program 1 times [2022-02-20 19:53:18,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:18,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106027973] [2022-02-20 19:53:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:18,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {9318#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {9320#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {9320#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {9320#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {9320#(<= 15 ~a24~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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {9320#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= 15 ~a24~0)} is VALID [2022-02-20 19:53:18,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {9320#(<= 15 ~a24~0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {9319#false} is VALID [2022-02-20 19:53:18,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {9319#false} assume !false; {9319#false} is VALID [2022-02-20 19:53:18,906 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:53:18,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:18,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106027973] [2022-02-20 19:53:18,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106027973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:18,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:18,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:18,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822501419] [2022-02-20 19:53:18,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:53:18,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:18,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:53:18,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:18,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:18,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:18,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:18,941 INFO L87 Difference]: Start difference. First operand 899 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:53:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:23,608 INFO L93 Difference]: Finished difference Result 2403 states and 4503 transitions. [2022-02-20 19:53:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:53:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:53:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:53:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:23,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4503 transitions. [2022-02-20 19:53:26,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4503 edges. 4503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:26,725 INFO L225 Difference]: With dead ends: 2403 [2022-02-20 19:53:26,725 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:26,726 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:53:26,727 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 961 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:26,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 619 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:53:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:26,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:26,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have 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:53:26,799 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have 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:53:26,801 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have 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:53:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:26,878 INFO L93 Difference]: Finished difference Result 1650 states and 2657 transitions. [2022-02-20 19:53:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2657 transitions. [2022-02-20 19:53:26,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:26,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:26,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:26,885 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:26,959 INFO L93 Difference]: Finished difference Result 1650 states and 2657 transitions. [2022-02-20 19:53:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2657 transitions. [2022-02-20 19:53:26,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:26,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:26,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:26,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.612257281553398) internal successors, (2657), 1649 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have 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:53:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2657 transitions. [2022-02-20 19:53:27,052 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2657 transitions. Word has length 48 [2022-02-20 19:53:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:27,053 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 2657 transitions. [2022-02-20 19:53:27,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:53:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2657 transitions. [2022-02-20 19:53:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:27,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:27,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:27,058 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 211182729, now seen corresponding path program 1 times [2022-02-20 19:53:27,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:27,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094324565] [2022-02-20 19:53:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:27,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {16725#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {16725#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {16725#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {16725#true} assume 0 == ~r1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {16725#true} assume ~id1~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {16725#true} assume 0 == ~st1~0; {16725#true} is VALID [2022-02-20 19:53:27,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {16725#true} assume ~send1~0 == ~id1~0; {16725#true} is VALID [2022-02-20 19:53:27,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {16725#true} assume 0 == ~mode1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:27,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {16725#true} assume ~id2~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:27,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {16725#true} assume 0 == ~st2~0; {16725#true} is VALID [2022-02-20 19:53:27,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {16725#true} assume ~send2~0 == ~id2~0; {16725#true} is VALID [2022-02-20 19:53:27,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {16725#true} assume 0 == ~mode2~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,228 INFO L290 TraceCheckUtils]: 69: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {16726#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {16726#false} ~mode2~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {16726#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {16726#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {16726#false} ~mode3~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {16726#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 82: Hoare triple {16726#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 83: Hoare triple {16726#false} ~mode4~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 84: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:27,231 INFO L290 TraceCheckUtils]: 85: Hoare triple {16726#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 86: Hoare triple {16726#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {16726#false} ~mode5~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 88: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 89: Hoare triple {16726#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {16726#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 91: Hoare triple {16726#false} ~mode6~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {16726#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 93: Hoare triple {16726#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 94: Hoare triple {16726#false} assume !(node7_~m7~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 95: Hoare triple {16726#false} ~mode7~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 96: Hoare triple {16726#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 97: Hoare triple {16726#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {16726#false} assume !(node8_~m8~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 99: Hoare triple {16726#false} ~mode8~0 := 0; {16726#false} is VALID [2022-02-20 19:53:27,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {16726#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16726#false} is VALID [2022-02-20 19:53:27,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {16726#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {16726#false} is VALID [2022-02-20 19:53:27,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {16726#false} check_#res#1 := check_~tmp~1#1; {16726#false} is VALID [2022-02-20 19:53:27,234 INFO L290 TraceCheckUtils]: 103: Hoare triple {16726#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {16726#false} is VALID [2022-02-20 19:53:27,234 INFO L290 TraceCheckUtils]: 104: Hoare triple {16726#false} assume 0 == assert_~arg#1 % 256; {16726#false} is VALID [2022-02-20 19:53:27,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {16726#false} assume !false; {16726#false} is VALID [2022-02-20 19:53:27,241 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:53:27,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:27,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094324565] [2022-02-20 19:53:27,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094324565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:27,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:27,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:27,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947597552] [2022-02-20 19:53:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:27,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:27,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:27,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:27,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:27,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:27,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:27,304 INFO L87 Difference]: Start difference. First operand 1650 states and 2657 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:29,179 INFO L93 Difference]: Finished difference Result 1800 states and 2895 transitions. [2022-02-20 19:53:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:29,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:30,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:30,764 INFO L225 Difference]: With dead ends: 1800 [2022-02-20 19:53:30,764 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:53:30,764 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:53:30,765 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1549 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1850 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:53:30,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 1850 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:53:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:53:30,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:30,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have 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:53:30,810 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have 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:53:30,812 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have 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:53:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:30,891 INFO L93 Difference]: Finished difference Result 1722 states and 2770 transitions. [2022-02-20 19:53:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2770 transitions. [2022-02-20 19:53:30,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:30,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:30,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:30,897 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:30,975 INFO L93 Difference]: Finished difference Result 1722 states and 2770 transitions. [2022-02-20 19:53:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2770 transitions. [2022-02-20 19:53:30,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:30,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:30,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:30,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.6117578579743888) internal successors, (2769), 1719 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have 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:53:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2769 transitions. [2022-02-20 19:53:31,059 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2769 transitions. Word has length 106 [2022-02-20 19:53:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:31,060 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2769 transitions. [2022-02-20 19:53:31,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2769 transitions. [2022-02-20 19:53:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:31,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:31,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:31,061 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1458691583, now seen corresponding path program 1 times [2022-02-20 19:53:31,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:31,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145176116] [2022-02-20 19:53:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:31,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {23771#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {23771#true} is VALID [2022-02-20 19:53:31,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {23771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {23771#true} is VALID [2022-02-20 19:53:31,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {23771#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23771#true} is VALID [2022-02-20 19:53:31,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {23771#true} assume 0 == ~r1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:31,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {23771#true} assume ~id1~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {23771#true} assume 0 == ~st1~0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {23771#true} assume ~send1~0 == ~id1~0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {23771#true} assume 0 == ~mode1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {23771#true} assume ~id2~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {23771#true} assume 0 == ~st2~0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {23771#true} assume ~send2~0 == ~id2~0; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {23771#true} assume 0 == ~mode2~0 % 256; {23771#true} is VALID [2022-02-20 19:53:31,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {23771#true} assume ~id3~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:31,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {23771#true} assume 0 == ~st3~0; {23771#true} is VALID [2022-02-20 19:53:31,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {23771#true} assume ~send3~0 == ~id3~0; {23771#true} is VALID [2022-02-20 19:53:31,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {23771#true} assume 0 == ~mode3~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,155 INFO L290 TraceCheckUtils]: 71: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,155 INFO L290 TraceCheckUtils]: 73: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {23772#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 79: Hoare triple {23772#false} ~mode3~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 81: Hoare triple {23772#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,157 INFO L290 TraceCheckUtils]: 82: Hoare triple {23772#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 83: Hoare triple {23772#false} ~mode4~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 84: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 85: Hoare triple {23772#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 86: Hoare triple {23772#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 87: Hoare triple {23772#false} ~mode5~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 88: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 89: Hoare triple {23772#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {23772#false} assume !(node6_~m6~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 91: Hoare triple {23772#false} ~mode6~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 92: Hoare triple {23772#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {23772#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {23772#false} assume !(node7_~m7~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 95: Hoare triple {23772#false} ~mode7~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 96: Hoare triple {23772#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 97: Hoare triple {23772#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:31,159 INFO L290 TraceCheckUtils]: 98: Hoare triple {23772#false} assume !(node8_~m8~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 99: Hoare triple {23772#false} ~mode8~0 := 0; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {23772#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 101: Hoare triple {23772#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {23772#false} check_#res#1 := check_~tmp~1#1; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 103: Hoare triple {23772#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 104: Hoare triple {23772#false} assume 0 == assert_~arg#1 % 256; {23772#false} is VALID [2022-02-20 19:53:31,160 INFO L290 TraceCheckUtils]: 105: Hoare triple {23772#false} assume !false; {23772#false} is VALID [2022-02-20 19:53:31,161 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:53:31,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:31,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145176116] [2022-02-20 19:53:31,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145176116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:31,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:31,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:31,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129102490] [2022-02-20 19:53:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:31,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:31,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:31,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:31,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:31,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:31,231 INFO L87 Difference]: Start difference. First operand 1720 states and 2769 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:33,051 INFO L93 Difference]: Finished difference Result 2004 states and 3221 transitions. [2022-02-20 19:53:33,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:33,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:34,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:34,666 INFO L225 Difference]: With dead ends: 2004 [2022-02-20 19:53:34,666 INFO L226 Difference]: Without dead ends: 1856 [2022-02-20 19:53:34,667 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:53:34,671 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1545 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1849 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:53:34,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 1849 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2022-02-20 19:53:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2022-02-20 19:53:34,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:34,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have 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:53:34,754 INFO L74 IsIncluded]: Start isIncluded. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have 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:53:34,755 INFO L87 Difference]: Start difference. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have 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:53:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:34,842 INFO L93 Difference]: Finished difference Result 1856 states and 2983 transitions. [2022-02-20 19:53:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2983 transitions. [2022-02-20 19:53:34,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:34,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:34,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:53:34,847 INFO L87 Difference]: Start difference. First operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:53:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:34,935 INFO L93 Difference]: Finished difference Result 1856 states and 2983 transitions. [2022-02-20 19:53:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2983 transitions. [2022-02-20 19:53:34,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:34,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:34,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:34,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1852 states have (on average 1.6101511879049677) internal successors, (2982), 1853 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have 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:53:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2982 transitions. [2022-02-20 19:53:35,029 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2982 transitions. Word has length 106 [2022-02-20 19:53:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:35,029 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 2982 transitions. [2022-02-20 19:53:35,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2982 transitions. [2022-02-20 19:53:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:35,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:35,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:53:35,031 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 717259381, now seen corresponding path program 1 times [2022-02-20 19:53:35,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:35,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834146873] [2022-02-20 19:53:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:35,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {31478#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {31478#true} is VALID [2022-02-20 19:53:35,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {31478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {31478#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {31478#true} assume 0 == ~r1~0 % 256; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {31478#true} assume ~id1~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {31478#true} assume 0 == ~st1~0; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {31478#true} assume ~send1~0 == ~id1~0; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {31478#true} assume 0 == ~mode1~0 % 256; {31478#true} is VALID [2022-02-20 19:53:35,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {31478#true} assume ~id2~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {31478#true} assume 0 == ~st2~0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {31478#true} assume ~send2~0 == ~id2~0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {31478#true} assume 0 == ~mode2~0 % 256; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {31478#true} assume ~id3~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {31478#true} assume 0 == ~st3~0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {31478#true} assume ~send3~0 == ~id3~0; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {31478#true} assume 0 == ~mode3~0 % 256; {31478#true} is VALID [2022-02-20 19:53:35,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {31478#true} assume ~id4~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:35,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {31478#true} assume 0 == ~st4~0; {31478#true} is VALID [2022-02-20 19:53:35,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {31478#true} assume ~send4~0 == ~id4~0; {31478#true} is VALID [2022-02-20 19:53:35,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {31478#true} assume 0 == ~mode4~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,104 INFO L290 TraceCheckUtils]: 51: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {31480#(= (+ (* (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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,113 INFO L290 TraceCheckUtils]: 74: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,114 INFO L290 TraceCheckUtils]: 79: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:35,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {31480#(= (+ (* (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; {31479#false} is VALID [2022-02-20 19:53:35,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {31479#false} assume !(node4_~m4~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:35,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {31479#false} ~mode4~0 := 0; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#false} assume !(node5_~m5~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {31479#false} ~mode5~0 := 0; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 88: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {31479#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,116 INFO L290 TraceCheckUtils]: 90: Hoare triple {31479#false} assume !(node6_~m6~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 91: Hoare triple {31479#false} ~mode6~0 := 0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {31479#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {31479#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {31479#false} assume !(node7_~m7~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 95: Hoare triple {31479#false} ~mode7~0 := 0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 96: Hoare triple {31479#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 97: Hoare triple {31479#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:35,117 INFO L290 TraceCheckUtils]: 98: Hoare triple {31479#false} assume !(node8_~m8~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 99: Hoare triple {31479#false} ~mode8~0 := 0; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 100: Hoare triple {31479#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 101: Hoare triple {31479#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 102: Hoare triple {31479#false} check_#res#1 := check_~tmp~1#1; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 103: Hoare triple {31479#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 104: Hoare triple {31479#false} assume 0 == assert_~arg#1 % 256; {31479#false} is VALID [2022-02-20 19:53:35,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {31479#false} assume !false; {31479#false} is VALID [2022-02-20 19:53:35,119 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:53:35,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:35,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834146873] [2022-02-20 19:53:35,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834146873] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:35,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:35,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:35,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224841639] [2022-02-20 19:53:35,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:35,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:35,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:35,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:35,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:35,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:35,188 INFO L87 Difference]: Start difference. First operand 1854 states and 2982 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:37,082 INFO L93 Difference]: Finished difference Result 2394 states and 3840 transitions. [2022-02-20 19:53:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:37,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:37,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:38,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:38,717 INFO L225 Difference]: With dead ends: 2394 [2022-02-20 19:53:38,717 INFO L226 Difference]: Without dead ends: 2112 [2022-02-20 19:53:38,718 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:53:38,720 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1541 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1848 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:53:38,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 1848 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-02-20 19:53:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2110. [2022-02-20 19:53:38,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:38,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 0 states have 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:53:38,792 INFO L74 IsIncluded]: Start isIncluded. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 0 states have 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:53:38,794 INFO L87 Difference]: Start difference. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 0 states have 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:53:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:38,912 INFO L93 Difference]: Finished difference Result 2112 states and 3387 transitions. [2022-02-20 19:53:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3387 transitions. [2022-02-20 19:53:38,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:38,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:38,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:53:38,918 INFO L87 Difference]: Start difference. First operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:53:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:39,029 INFO L93 Difference]: Finished difference Result 2112 states and 3387 transitions. [2022-02-20 19:53:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3387 transitions. [2022-02-20 19:53:39,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:39,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:39,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:39,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2108 states have (on average 1.6062618595825426) internal successors, (3386), 2109 states have internal predecessors, (3386), 0 states have call successors, (0), 0 states have 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:53:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3386 transitions. [2022-02-20 19:53:39,152 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3386 transitions. Word has length 106 [2022-02-20 19:53:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:39,152 INFO L470 AbstractCegarLoop]: Abstraction has 2110 states and 3386 transitions. [2022-02-20 19:53:39,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3386 transitions. [2022-02-20 19:53:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:39,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:39,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:39,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:53:39,154 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -28323349, now seen corresponding path program 1 times [2022-02-20 19:53:39,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:39,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996887029] [2022-02-20 19:53:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:39,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {40453#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {40453#true} is VALID [2022-02-20 19:53:39,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {40453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {40453#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {40453#true} assume 0 == ~r1~0 % 256; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {40453#true} assume ~id1~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {40453#true} assume 0 == ~st1~0; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {40453#true} assume ~send1~0 == ~id1~0; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {40453#true} assume 0 == ~mode1~0 % 256; {40453#true} is VALID [2022-02-20 19:53:39,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {40453#true} assume ~id2~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {40453#true} assume 0 == ~st2~0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {40453#true} assume ~send2~0 == ~id2~0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {40453#true} assume 0 == ~mode2~0 % 256; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {40453#true} assume ~id3~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {40453#true} assume 0 == ~st3~0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {40453#true} assume ~send3~0 == ~id3~0; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {40453#true} assume 0 == ~mode3~0 % 256; {40453#true} is VALID [2022-02-20 19:53:39,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {40453#true} assume ~id4~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {40453#true} assume 0 == ~st4~0; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {40453#true} assume ~send4~0 == ~id4~0; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {40453#true} assume 0 == ~mode4~0 % 256; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {40453#true} assume ~id5~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {40453#true} assume 0 == ~st5~0; {40453#true} is VALID [2022-02-20 19:53:39,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {40453#true} assume ~send5~0 == ~id5~0; {40453#true} is VALID [2022-02-20 19:53:39,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {40453#true} assume 0 == ~mode5~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,258 INFO L290 TraceCheckUtils]: 59: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,261 INFO L290 TraceCheckUtils]: 67: Hoare triple {40455#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,265 INFO L290 TraceCheckUtils]: 78: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:39,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {40455#(= (+ (* (- 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; {40454#false} is VALID [2022-02-20 19:53:39,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {40454#false} assume !(node5_~m5~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:39,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {40454#false} ~mode5~0 := 0; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 89: Hoare triple {40454#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {40454#false} assume !(node6_~m6~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 91: Hoare triple {40454#false} ~mode6~0 := 0; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 92: Hoare triple {40454#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {40454#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {40454#false} assume !(node7_~m7~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:39,269 INFO L290 TraceCheckUtils]: 95: Hoare triple {40454#false} ~mode7~0 := 0; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {40454#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 97: Hoare triple {40454#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 98: Hoare triple {40454#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 99: Hoare triple {40454#false} ~mode8~0 := 0; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 100: Hoare triple {40454#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 101: Hoare triple {40454#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 102: Hoare triple {40454#false} check_#res#1 := check_~tmp~1#1; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 103: Hoare triple {40454#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {40454#false} is VALID [2022-02-20 19:53:39,270 INFO L290 TraceCheckUtils]: 104: Hoare triple {40454#false} assume 0 == assert_~arg#1 % 256; {40454#false} is VALID [2022-02-20 19:53:39,271 INFO L290 TraceCheckUtils]: 105: Hoare triple {40454#false} assume !false; {40454#false} is VALID [2022-02-20 19:53:39,271 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:53:39,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:39,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996887029] [2022-02-20 19:53:39,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996887029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:39,272 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:39,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:39,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452137070] [2022-02-20 19:53:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:39,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:39,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:39,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:39,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:39,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:39,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:39,348 INFO L87 Difference]: Start difference. First operand 2110 states and 3386 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:41,371 INFO L93 Difference]: Finished difference Result 3138 states and 5012 transitions. [2022-02-20 19:53:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:41,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:42,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:43,037 INFO L225 Difference]: With dead ends: 3138 [2022-02-20 19:53:43,037 INFO L226 Difference]: Without dead ends: 2600 [2022-02-20 19:53:43,038 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:53:43,039 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1537 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1847 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:53:43,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1847 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2022-02-20 19:53:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2598. [2022-02-20 19:53:43,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:43,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have 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:53:43,149 INFO L74 IsIncluded]: Start isIncluded. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have 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:53:43,150 INFO L87 Difference]: Start difference. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have 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:53:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:43,312 INFO L93 Difference]: Finished difference Result 2600 states and 4151 transitions. [2022-02-20 19:53:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4151 transitions. [2022-02-20 19:53:43,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:43,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:43,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:53:43,320 INFO L87 Difference]: Start difference. First operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:53:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:43,484 INFO L93 Difference]: Finished difference Result 2600 states and 4151 transitions. [2022-02-20 19:53:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4151 transitions. [2022-02-20 19:53:43,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:43,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:43,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:43,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2596 states have (on average 1.5986132511556241) internal successors, (4150), 2597 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have 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:53:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4150 transitions. [2022-02-20 19:53:43,677 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4150 transitions. Word has length 106 [2022-02-20 19:53:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:43,678 INFO L470 AbstractCegarLoop]: Abstraction has 2598 states and 4150 transitions. [2022-02-20 19:53:43,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4150 transitions. [2022-02-20 19:53:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:43,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:43,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:43,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:53:43,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354207, now seen corresponding path program 1 times [2022-02-20 19:53:43,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:43,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802564787] [2022-02-20 19:53:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:43,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {51856#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {51856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {51856#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {51856#true} assume 0 == ~r1~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {51856#true} assume ~id1~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {51856#true} assume 0 == ~st1~0; {51856#true} is VALID [2022-02-20 19:53:43,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {51856#true} assume ~send1~0 == ~id1~0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {51856#true} assume 0 == ~mode1~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {51856#true} assume ~id2~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {51856#true} assume 0 == ~st2~0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {51856#true} assume ~send2~0 == ~id2~0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {51856#true} assume 0 == ~mode2~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {51856#true} assume ~id3~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {51856#true} assume 0 == ~st3~0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {51856#true} assume ~send3~0 == ~id3~0; {51856#true} is VALID [2022-02-20 19:53:43,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {51856#true} assume 0 == ~mode3~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {51856#true} assume ~id4~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {51856#true} assume 0 == ~st4~0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {51856#true} assume ~send4~0 == ~id4~0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {51856#true} assume 0 == ~mode4~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {51856#true} assume ~id5~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {51856#true} assume 0 == ~st5~0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {51856#true} assume ~send5~0 == ~id5~0; {51856#true} is VALID [2022-02-20 19:53:43,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {51856#true} assume 0 == ~mode5~0 % 256; {51856#true} is VALID [2022-02-20 19:53:43,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {51856#true} assume ~id6~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:43,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {51856#true} assume 0 == ~st6~0; {51856#true} is VALID [2022-02-20 19:53:43,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {51856#true} assume ~send6~0 == ~id6~0; {51856#true} is VALID [2022-02-20 19:53:43,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {51856#true} assume 0 == ~mode6~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,783 INFO L290 TraceCheckUtils]: 47: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {51858#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,797 INFO L290 TraceCheckUtils]: 80: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,797 INFO L290 TraceCheckUtils]: 81: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,800 INFO L290 TraceCheckUtils]: 88: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:43,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {51858#(= (+ (* (- 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; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 90: Hoare triple {51857#false} assume !(node6_~m6~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 91: Hoare triple {51857#false} ~mode6~0 := 0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 92: Hoare triple {51857#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 93: Hoare triple {51857#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 94: Hoare triple {51857#false} assume !(node7_~m7~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 95: Hoare triple {51857#false} ~mode7~0 := 0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 96: Hoare triple {51857#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 97: Hoare triple {51857#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:43,801 INFO L290 TraceCheckUtils]: 98: Hoare triple {51857#false} assume !(node8_~m8~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 99: Hoare triple {51857#false} ~mode8~0 := 0; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 100: Hoare triple {51857#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 101: Hoare triple {51857#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 102: Hoare triple {51857#false} check_#res#1 := check_~tmp~1#1; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 103: Hoare triple {51857#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {51857#false} assume 0 == assert_~arg#1 % 256; {51857#false} is VALID [2022-02-20 19:53:43,802 INFO L290 TraceCheckUtils]: 105: Hoare triple {51857#false} assume !false; {51857#false} is VALID [2022-02-20 19:53:43,803 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:53:43,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:43,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802564787] [2022-02-20 19:53:43,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802564787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:43,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:43,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:43,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501703903] [2022-02-20 19:53:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:43,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:43,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:43,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:43,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:43,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:43,874 INFO L87 Difference]: Start difference. First operand 2598 states and 4150 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:46,321 INFO L93 Difference]: Finished difference Result 4554 states and 7224 transitions. [2022-02-20 19:53:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:46,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:47,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:48,210 INFO L225 Difference]: With dead ends: 4554 [2022-02-20 19:53:48,210 INFO L226 Difference]: Without dead ends: 3528 [2022-02-20 19:53:48,212 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:53:48,212 INFO L933 BasicCegarLoop]: 1704 mSDtfsCounter, 1533 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1846 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:53:48,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1846 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2022-02-20 19:53:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2022-02-20 19:53:48,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:48,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:53:48,411 INFO L74 IsIncluded]: Start isIncluded. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:53:48,414 INFO L87 Difference]: Start difference. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:53:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:48,733 INFO L93 Difference]: Finished difference Result 3528 states and 5591 transitions. [2022-02-20 19:53:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5591 transitions. [2022-02-20 19:53:48,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:48,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:48,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 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 3528 states. [2022-02-20 19:53:48,744 INFO L87 Difference]: Start difference. First operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 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 3528 states. [2022-02-20 19:53:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:49,077 INFO L93 Difference]: Finished difference Result 3528 states and 5591 transitions. [2022-02-20 19:53:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5591 transitions. [2022-02-20 19:53:49,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:49,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:49,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:49,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3524 states have (on average 1.5862656072644723) internal successors, (5590), 3525 states have internal predecessors, (5590), 0 states have call successors, (0), 0 states have 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:53:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5590 transitions. [2022-02-20 19:53:49,508 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5590 transitions. Word has length 106 [2022-02-20 19:53:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:49,509 INFO L470 AbstractCegarLoop]: Abstraction has 3526 states and 5590 transitions. [2022-02-20 19:53:49,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5590 transitions. [2022-02-20 19:53:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:49,512 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:49,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:49,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:53:49,519 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 732328407, now seen corresponding path program 1 times [2022-02-20 19:53:49,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:49,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371119105] [2022-02-20 19:53:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:49,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {67899#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {67899#true} is VALID [2022-02-20 19:53:49,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {67899#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {67899#true} is VALID [2022-02-20 19:53:49,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {67899#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {67899#true} assume 0 == ~r1~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {67899#true} assume ~id1~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {67899#true} assume 0 == ~st1~0; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {67899#true} assume ~send1~0 == ~id1~0; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {67899#true} assume 0 == ~mode1~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {67899#true} assume ~id2~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {67899#true} assume 0 == ~st2~0; {67899#true} is VALID [2022-02-20 19:53:49,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {67899#true} assume ~send2~0 == ~id2~0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {67899#true} assume 0 == ~mode2~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {67899#true} assume ~id3~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {67899#true} assume 0 == ~st3~0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {67899#true} assume ~send3~0 == ~id3~0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {67899#true} assume 0 == ~mode3~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {67899#true} assume ~id4~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {67899#true} assume 0 == ~st4~0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {67899#true} assume ~send4~0 == ~id4~0; {67899#true} is VALID [2022-02-20 19:53:49,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {67899#true} assume 0 == ~mode4~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {67899#true} assume ~id5~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {67899#true} assume 0 == ~st5~0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {67899#true} assume ~send5~0 == ~id5~0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {67899#true} assume 0 == ~mode5~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {67899#true} assume ~id6~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {67899#true} assume 0 == ~st6~0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {67899#true} assume ~send6~0 == ~id6~0; {67899#true} is VALID [2022-02-20 19:53:49,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {67899#true} assume 0 == ~mode6~0 % 256; {67899#true} is VALID [2022-02-20 19:53:49,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {67899#true} assume ~id7~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:49,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {67899#true} assume 0 == ~st7~0; {67899#true} is VALID [2022-02-20 19:53:49,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {67899#true} assume ~send7~0 == ~id7~0; {67899#true} is VALID [2022-02-20 19:53:49,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {67899#true} assume 0 == ~mode7~0 % 256; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,599 INFO L290 TraceCheckUtils]: 44: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,608 INFO L290 TraceCheckUtils]: 68: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,608 INFO L290 TraceCheckUtils]: 70: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,609 INFO L290 TraceCheckUtils]: 71: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,609 INFO L290 TraceCheckUtils]: 72: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,609 INFO L290 TraceCheckUtils]: 73: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,611 INFO L290 TraceCheckUtils]: 74: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,613 INFO L290 TraceCheckUtils]: 79: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,613 INFO L290 TraceCheckUtils]: 80: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,613 INFO L290 TraceCheckUtils]: 81: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,614 INFO L290 TraceCheckUtils]: 82: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,615 INFO L290 TraceCheckUtils]: 85: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,615 INFO L290 TraceCheckUtils]: 86: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,615 INFO L290 TraceCheckUtils]: 87: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,616 INFO L290 TraceCheckUtils]: 88: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,616 INFO L290 TraceCheckUtils]: 89: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,616 INFO L290 TraceCheckUtils]: 90: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,617 INFO L290 TraceCheckUtils]: 91: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 93: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 94: Hoare triple {67900#false} assume !(node7_~m7~0#1 != ~nomsg~0); {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {67900#false} ~mode7~0 := 0; {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 96: Hoare triple {67900#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 97: Hoare triple {67900#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {67900#false} assume !(node8_~m8~0#1 != ~nomsg~0); {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {67900#false} ~mode8~0 := 0; {67900#false} is VALID [2022-02-20 19:53:49,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {67900#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {67900#false} is VALID [2022-02-20 19:53:49,619 INFO L290 TraceCheckUtils]: 101: Hoare triple {67900#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {67900#false} is VALID [2022-02-20 19:53:49,619 INFO L290 TraceCheckUtils]: 102: Hoare triple {67900#false} check_#res#1 := check_~tmp~1#1; {67900#false} is VALID [2022-02-20 19:53:49,619 INFO L290 TraceCheckUtils]: 103: Hoare triple {67900#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {67900#false} is VALID [2022-02-20 19:53:49,619 INFO L290 TraceCheckUtils]: 104: Hoare triple {67900#false} assume 0 == assert_~arg#1 % 256; {67900#false} is VALID [2022-02-20 19:53:49,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {67900#false} assume !false; {67900#false} is VALID [2022-02-20 19:53:49,619 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:53:49,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:49,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371119105] [2022-02-20 19:53:49,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371119105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:49,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:49,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:49,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096380747] [2022-02-20 19:53:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:49,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:49,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:49,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:49,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:49,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:49,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:49,712 INFO L87 Difference]: Start difference. First operand 3526 states and 5590 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:53,363 INFO L93 Difference]: Finished difference Result 7242 states and 11384 transitions. [2022-02-20 19:53:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:53,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:53,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:54,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:55,737 INFO L225 Difference]: With dead ends: 7242 [2022-02-20 19:53:55,737 INFO L226 Difference]: Without dead ends: 5288 [2022-02-20 19:53:55,752 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:53:55,758 INFO L933 BasicCegarLoop]: 1699 mSDtfsCounter, 1529 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1845 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:53:55,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1845 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2022-02-20 19:53:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 5286. [2022-02-20 19:53:56,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:56,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have 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:53:56,129 INFO L74 IsIncluded]: Start isIncluded. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have 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:53:56,134 INFO L87 Difference]: Start difference. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have 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:53:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:56,822 INFO L93 Difference]: Finished difference Result 5288 states and 8295 transitions. [2022-02-20 19:53:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8295 transitions. [2022-02-20 19:53:56,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:56,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:56,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 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 5288 states. [2022-02-20 19:53:56,838 INFO L87 Difference]: Start difference. First operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 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 5288 states. [2022-02-20 19:53:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:57,544 INFO L93 Difference]: Finished difference Result 5288 states and 8295 transitions. [2022-02-20 19:53:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8295 transitions. [2022-02-20 19:53:57,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:57,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:57,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:57,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 5284 states have (on average 1.5696442089326268) internal successors, (8294), 5285 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have 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:53:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8294 transitions. [2022-02-20 19:53:58,483 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8294 transitions. Word has length 106 [2022-02-20 19:53:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:58,485 INFO L470 AbstractCegarLoop]: Abstraction has 5286 states and 8294 transitions. [2022-02-20 19:53:58,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8294 transitions. [2022-02-20 19:53:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:58,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:58,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:53:58,486 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1070121549, now seen corresponding path program 1 times [2022-02-20 19:53:58,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:58,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830820030] [2022-02-20 19:53:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:58,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {92790#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(32, 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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {92790#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {92790#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {92790#true} assume 0 == ~r1~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {92790#true} assume ~id1~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {92790#true} assume 0 == ~st1~0; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {92790#true} assume ~send1~0 == ~id1~0; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {92790#true} assume 0 == ~mode1~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {92790#true} assume ~id2~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {92790#true} assume 0 == ~st2~0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {92790#true} assume ~send2~0 == ~id2~0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {92790#true} assume 0 == ~mode2~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {92790#true} assume ~id3~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {92790#true} assume 0 == ~st3~0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {92790#true} assume ~send3~0 == ~id3~0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {92790#true} assume 0 == ~mode3~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {92790#true} assume ~id4~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {92790#true} assume 0 == ~st4~0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {92790#true} assume ~send4~0 == ~id4~0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {92790#true} assume 0 == ~mode4~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {92790#true} assume ~id5~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {92790#true} assume 0 == ~st5~0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {92790#true} assume ~send5~0 == ~id5~0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {92790#true} assume 0 == ~mode5~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {92790#true} assume ~id6~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {92790#true} assume 0 == ~st6~0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {92790#true} assume ~send6~0 == ~id6~0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {92790#true} assume 0 == ~mode6~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {92790#true} assume ~id7~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {92790#true} assume 0 == ~st7~0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {92790#true} assume ~send7~0 == ~id7~0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {92790#true} assume 0 == ~mode7~0 % 256; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {92790#true} assume ~id8~0 >= 0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {92790#true} assume 0 == ~st8~0; {92790#true} is VALID [2022-02-20 19:53:58,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {92790#true} assume ~send8~0 == ~id8~0; {92790#true} is VALID [2022-02-20 19:53:58,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {92790#true} assume 0 == ~mode8~0 % 256; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,551 INFO L290 TraceCheckUtils]: 57: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} init_#res#1 := init_~tmp~0#1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,554 INFO L290 TraceCheckUtils]: 65: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !false;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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode1~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode2~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode3~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode4~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode5~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,562 INFO L290 TraceCheckUtils]: 87: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode6~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode7~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,565 INFO L290 TraceCheckUtils]: 94: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,565 INFO L290 TraceCheckUtils]: 95: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 97: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 98: Hoare triple {92791#false} assume !(node8_~m8~0#1 != ~nomsg~0); {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 99: Hoare triple {92791#false} ~mode8~0 := 0; {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 100: Hoare triple {92791#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {92791#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {92791#false} check_#res#1 := check_~tmp~1#1; {92791#false} is VALID [2022-02-20 19:53:58,566 INFO L290 TraceCheckUtils]: 103: Hoare triple {92791#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {92791#false} is VALID [2022-02-20 19:53:58,567 INFO L290 TraceCheckUtils]: 104: Hoare triple {92791#false} assume 0 == assert_~arg#1 % 256; {92791#false} is VALID [2022-02-20 19:53:58,567 INFO L290 TraceCheckUtils]: 105: Hoare triple {92791#false} assume !false; {92791#false} is VALID [2022-02-20 19:53:58,567 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:53:58,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:58,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830820030] [2022-02-20 19:53:58,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830820030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:58,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:58,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:58,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487761814] [2022-02-20 19:53:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:58,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:58,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:58,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:58,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:58,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:58,639 INFO L87 Difference]: Start difference. First operand 5286 states and 8294 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:54:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:05,695 INFO L93 Difference]: Finished difference Result 12330 states and 19176 transitions. [2022-02-20 19:54:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:05,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:54:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:54:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:05,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions.