./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.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 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:52,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:52,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:52,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:52,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:52,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:52,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:52,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:52,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:52,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:52,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:52,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:52,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:52,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:52,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:52,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:52,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:52,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:52,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:52,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:52,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:52,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:52,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:52,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:52,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:52,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:52,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:52,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:52,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:52,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:52,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:52,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:52,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:52,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:52,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:52,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:52,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:52,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:52,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:52,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:52,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:52,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:30:52,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:52,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:52,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:52,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:52,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:52,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:52,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:52,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:52,789 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:52,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:52,790 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:52,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:52,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:52,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:52,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:52,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:52,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:52,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:52,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:52,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:52,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:52,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:52,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:52,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:52,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:52,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:52,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:52,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:52,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:52,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:52,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:52,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:52,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:52,795 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 -> 584cb00847e346bcb7b5af30068947c52ce3c4d690063caf12c5ab86dbf7ec89 [2022-02-20 18:30:53,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:53,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:53,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:53,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:53,059 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:53,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-20 18:30:53,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31c534f1/aef32c539d3f4b1e932426b50cd4f448/FLAGdabeb2a24 [2022-02-20 18:30:53,524 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:53,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-20 18:30:53,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31c534f1/aef32c539d3f4b1e932426b50cd4f448/FLAGdabeb2a24 [2022-02-20 18:30:53,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31c534f1/aef32c539d3f4b1e932426b50cd4f448 [2022-02-20 18:30:53,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:53,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:53,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:53,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:53,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:53,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:53,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a0d8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53, skipping insertion in model container [2022-02-20 18:30:53,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:53,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:53,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:53,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-02-20 18:30:53,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:53,924 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:53,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.BOUNDED-16.pals.c[26490,26503] [2022-02-20 18:30:53,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:53,992 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:53,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53 WrapperNode [2022-02-20 18:30:53,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:53,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:53,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:53,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:54,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,063 INFO L137 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 525 [2022-02-20 18:30:54,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:54,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:54,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:54,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:54,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:54,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:54,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:54,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:54,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (1/1) ... [2022-02-20 18:30:54,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:54,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:54,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:30:54,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:30:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:54,301 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:54,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:55,067 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:55,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:55,079 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:55,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:55 BoogieIcfgContainer [2022-02-20 18:30:55,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:55,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:55,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:55,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:55,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:53" (1/3) ... [2022-02-20 18:30:55,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c38c1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:55, skipping insertion in model container [2022-02-20 18:30:55,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:53" (2/3) ... [2022-02-20 18:30:55,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c38c1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:55, skipping insertion in model container [2022-02-20 18:30:55,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:55" (3/3) ... [2022-02-20 18:30:55,088 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c [2022-02-20 18:30:55,092 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:55,092 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:55,128 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:55,132 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:30:55,132 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 146 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:30:55,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:55,165 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] [2022-02-20 18:30:55,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2022-02-20 18:30:55,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:55,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888955055] [2022-02-20 18:30:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:55,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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(35, 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]; {150#true} is VALID [2022-02-20 18:30:55,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {150#true} is VALID [2022-02-20 18:30:55,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {150#true} is VALID [2022-02-20 18:30:55,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} init_#res#1 := init_~tmp~0#1; {150#true} is VALID [2022-02-20 18:30:55,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#true} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {150#true} is VALID [2022-02-20 18:30:55,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {151#false} is VALID [2022-02-20 18:30:55,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#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;main_~i2~0#1 := 0; {151#false} is VALID [2022-02-20 18:30:55,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#false} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !(node1_~m1~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} ~mode1~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume !(node2_~m2~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} ~mode2~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {151#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {151#false} assume !(node3_~m3~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {151#false} ~mode3~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {151#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {151#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {151#false} assume !(node4_~m4~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {151#false} ~mode4~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {151#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {151#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {151#false} assume !(node5_~m5~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {151#false} ~mode5~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {151#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {151#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#false} assume !(node6_~m6~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:30:55,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {151#false} ~mode6~0 := 0; {151#false} is VALID [2022-02-20 18:30:55,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {151#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {151#false} assume !(0 != ~mode7~0 % 256); {151#false} is VALID [2022-02-20 18:30:55,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {151#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {151#false} is VALID [2022-02-20 18:30:55,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {151#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {151#false} is VALID [2022-02-20 18:30:55,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {151#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:30:55,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {151#false} assume !(0 != ~mode8~0 % 256); {151#false} is VALID [2022-02-20 18:30:55,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {151#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {151#false} is VALID [2022-02-20 18:30:55,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {151#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {151#false} is VALID [2022-02-20 18:30:55,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:30:55,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {151#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {151#false} is VALID [2022-02-20 18:30:55,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {151#false} check_#res#1 := check_~tmp~1#1; {151#false} is VALID [2022-02-20 18:30:55,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {151#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {151#false} is VALID [2022-02-20 18:30:55,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {151#false} assume 0 == assert_~arg#1 % 256; {151#false} is VALID [2022-02-20 18:30:55,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 18:30:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:55,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:55,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888955055] [2022-02-20 18:30:55,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888955055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:55,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:55,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:55,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727217514] [2022-02-20 18:30:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:55,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:55,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:55,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:55,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:55,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:55,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:55,622 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 146 states have internal predecessors, (256), 0 states have call successors, (0), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:55,796 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2022-02-20 18:30:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:55,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 384 transitions. [2022-02-20 18:30:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 384 transitions. [2022-02-20 18:30:55,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 384 transitions. [2022-02-20 18:30:56,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:56,193 INFO L225 Difference]: With dead ends: 228 [2022-02-20 18:30:56,193 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:30:56,197 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 18:30:56,200 INFO L933 BasicCegarLoop]: 253 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, 253 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 18:30:56,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:30:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 18:30:56,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:56,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,237 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,238 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:56,262 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2022-02-20 18:30:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:30:56,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:56,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:56,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:30:56,270 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:30:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:56,281 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2022-02-20 18:30:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:30:56,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:56,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:56,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:56,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 249 transitions. [2022-02-20 18:30:56,290 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 249 transitions. Word has length 45 [2022-02-20 18:30:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:56,291 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 249 transitions. [2022-02-20 18:30:56,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:30:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:30:56,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:56,293 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] [2022-02-20 18:30:56,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:56,294 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2022-02-20 18:30:56,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:56,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413466478] [2022-02-20 18:30:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:56,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {848#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(35, 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]; {848#true} is VALID [2022-02-20 18:30:56,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {848#true} is VALID [2022-02-20 18:30:56,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {850#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:56,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {851#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:56,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {851#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {852#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:56,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {849#false} is VALID [2022-02-20 18:30:56,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#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;main_~i2~0#1 := 0; {849#false} is VALID [2022-02-20 18:30:56,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#false} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#false} assume !(node1_~m1~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#false} ~mode1~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#false} assume !(node2_~m2~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#false} ~mode2~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {849#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {849#false} assume !(node3_~m3~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#false} ~mode3~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {849#false} assume !(node4_~m4~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {849#false} ~mode4~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {849#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {849#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {849#false} assume !(node5_~m5~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {849#false} ~mode5~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {849#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {849#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {849#false} assume !(node6_~m6~0#1 != ~nomsg~0); {849#false} is VALID [2022-02-20 18:30:56,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {849#false} ~mode6~0 := 0; {849#false} is VALID [2022-02-20 18:30:56,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {849#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {849#false} assume !(0 != ~mode7~0 % 256); {849#false} is VALID [2022-02-20 18:30:56,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {849#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {849#false} is VALID [2022-02-20 18:30:56,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {849#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {849#false} is VALID [2022-02-20 18:30:56,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {849#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {849#false} is VALID [2022-02-20 18:30:56,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {849#false} assume !(0 != ~mode8~0 % 256); {849#false} is VALID [2022-02-20 18:30:56,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {849#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {849#false} is VALID [2022-02-20 18:30:56,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {849#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {849#false} is VALID [2022-02-20 18:30:56,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {849#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; {849#false} is VALID [2022-02-20 18:30:56,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {849#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {849#false} is VALID [2022-02-20 18:30:56,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {849#false} check_#res#1 := check_~tmp~1#1; {849#false} is VALID [2022-02-20 18:30:56,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {849#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {849#false} is VALID [2022-02-20 18:30:56,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {849#false} assume 0 == assert_~arg#1 % 256; {849#false} is VALID [2022-02-20 18:30:56,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-02-20 18:30:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:56,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:56,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413466478] [2022-02-20 18:30:56,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413466478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:56,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:56,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:56,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730466913] [2022-02-20 18:30:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:56,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:56,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:56,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:56,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:56,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:56,503 INFO L87 Difference]: Start difference. First operand 143 states and 249 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:57,047 INFO L93 Difference]: Finished difference Result 223 states and 374 transitions. [2022-02-20 18:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-02-20 18:30:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-02-20 18:30:57,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-02-20 18:30:57,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:57,310 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:30:57,310 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:30:57,314 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 18:30:57,316 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 924 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:57,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 924 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:30:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 18:30:57,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:57,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,330 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,330 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:57,335 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2022-02-20 18:30:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:30:57,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:57,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:57,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:30:57,339 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:30:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:57,346 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2022-02-20 18:30:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:30:57,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:57,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:57,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:57,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2022-02-20 18:30:57,357 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 45 [2022-02-20 18:30:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:57,358 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2022-02-20 18:30:57,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:30:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:30:57,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:57,361 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] [2022-02-20 18:30:57,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:57,361 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2022-02-20 18:30:57,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:57,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600484477] [2022-02-20 18:30:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:57,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1547#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(35, 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]; {1547#true} is VALID [2022-02-20 18:30:57,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1547#true} is VALID [2022-02-20 18:30:57,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1547#true} assume 0 == ~r1~0; {1547#true} is VALID [2022-02-20 18:30:57,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {1547#true} assume ~id1~0 >= 0; {1547#true} is VALID [2022-02-20 18:30:57,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {1547#true} assume 0 == ~st1~0; {1547#true} is VALID [2022-02-20 18:30:57,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1547#true} assume ~send1~0 == ~id1~0; {1547#true} is VALID [2022-02-20 18:30:57,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#true} assume 0 == ~mode1~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:57,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {1549#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {1548#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,633 INFO L290 TraceCheckUtils]: 70: Hoare triple {1548#false} ~mode1~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {1548#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,633 INFO L290 TraceCheckUtils]: 72: Hoare triple {1548#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {1548#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {1548#false} ~mode2~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {1548#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {1548#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {1548#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {1548#false} ~mode3~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 79: Hoare triple {1548#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 80: Hoare triple {1548#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {1548#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {1548#false} ~mode4~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {1548#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {1548#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {1548#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {1548#false} ~mode5~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,637 INFO L290 TraceCheckUtils]: 87: Hoare triple {1548#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {1548#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,637 INFO L290 TraceCheckUtils]: 89: Hoare triple {1548#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1548#false} is VALID [2022-02-20 18:30:57,637 INFO L290 TraceCheckUtils]: 90: Hoare triple {1548#false} ~mode6~0 := 0; {1548#false} is VALID [2022-02-20 18:30:57,637 INFO L290 TraceCheckUtils]: 91: Hoare triple {1548#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,638 INFO L290 TraceCheckUtils]: 92: Hoare triple {1548#false} assume !(0 != ~mode7~0 % 256); {1548#false} is VALID [2022-02-20 18:30:57,638 INFO L290 TraceCheckUtils]: 93: Hoare triple {1548#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {1548#false} is VALID [2022-02-20 18:30:57,638 INFO L290 TraceCheckUtils]: 94: Hoare triple {1548#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {1548#false} is VALID [2022-02-20 18:30:57,638 INFO L290 TraceCheckUtils]: 95: Hoare triple {1548#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {1548#false} is VALID [2022-02-20 18:30:57,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {1548#false} assume !(0 != ~mode8~0 % 256); {1548#false} is VALID [2022-02-20 18:30:57,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {1548#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {1548#false} is VALID [2022-02-20 18:30:57,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {1548#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {1548#false} is VALID [2022-02-20 18:30:57,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {1548#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; {1548#false} is VALID [2022-02-20 18:30:57,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {1548#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {1548#false} is VALID [2022-02-20 18:30:57,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {1548#false} check_#res#1 := check_~tmp~1#1; {1548#false} is VALID [2022-02-20 18:30:57,641 INFO L290 TraceCheckUtils]: 102: Hoare triple {1548#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1548#false} is VALID [2022-02-20 18:30:57,641 INFO L290 TraceCheckUtils]: 103: Hoare triple {1548#false} assume 0 == assert_~arg#1 % 256; {1548#false} is VALID [2022-02-20 18:30:57,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2022-02-20 18:30:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:57,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:57,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600484477] [2022-02-20 18:30:57,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600484477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:57,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:57,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:57,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084553852] [2022-02-20 18:30:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:57,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:57,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:57,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:57,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:57,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:57,749 INFO L87 Difference]: Start difference. First operand 143 states and 188 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:58,037 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2022-02-20 18:30:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:58,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:58,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:30:58,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:58,419 INFO L225 Difference]: With dead ends: 289 [2022-02-20 18:30:58,420 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 18:30:58,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:58,421 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:58,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 414 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 18:30:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-02-20 18:30:58,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:58,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,431 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,432 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:58,438 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 18:30:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 18:30:58,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:58,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:58,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:30:58,440 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:30:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:58,446 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 18:30:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 18:30:58,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:58,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:58,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:58,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 297 transitions. [2022-02-20 18:30:58,453 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 297 transitions. Word has length 105 [2022-02-20 18:30:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:58,453 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 297 transitions. [2022-02-20 18:30:58,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 297 transitions. [2022-02-20 18:30:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:30:58,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:58,455 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] [2022-02-20 18:30:58,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:30:58,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2022-02-20 18:30:58,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:58,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206991405] [2022-02-20 18:30:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:58,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2535#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(35, 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]; {2535#true} is VALID [2022-02-20 18:30:58,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2535#true} is VALID [2022-02-20 18:30:58,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume 0 == ~r1~0; {2535#true} is VALID [2022-02-20 18:30:58,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {2535#true} assume ~id1~0 >= 0; {2535#true} is VALID [2022-02-20 18:30:58,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {2535#true} assume 0 == ~st1~0; {2535#true} is VALID [2022-02-20 18:30:58,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {2535#true} assume ~send1~0 == ~id1~0; {2535#true} is VALID [2022-02-20 18:30:58,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {2535#true} assume 0 == ~mode1~0 % 256; {2535#true} is VALID [2022-02-20 18:30:58,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2535#true} assume ~id2~0 >= 0; {2535#true} is VALID [2022-02-20 18:30:58,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2535#true} assume 0 == ~st2~0; {2535#true} is VALID [2022-02-20 18:30:58,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {2535#true} assume ~send2~0 == ~id2~0; {2535#true} is VALID [2022-02-20 18:30:58,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {2535#true} assume 0 == ~mode2~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {2537#(= (+ (* (- 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;main_~i2~0#1 := 0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2537#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:58,602 INFO L290 TraceCheckUtils]: 72: Hoare triple {2537#(= (+ (* (- 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; {2536#false} is VALID [2022-02-20 18:30:58,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {2536#false} assume !(node2_~m2~0#1 != ~nomsg~0); {2536#false} is VALID [2022-02-20 18:30:58,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {2536#false} ~mode2~0 := 0; {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {2536#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 76: Hoare triple {2536#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {2536#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {2536#false} ~mode3~0 := 0; {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {2536#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,603 INFO L290 TraceCheckUtils]: 80: Hoare triple {2536#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {2536#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2536#false} is VALID [2022-02-20 18:30:58,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {2536#false} ~mode4~0 := 0; {2536#false} is VALID [2022-02-20 18:30:58,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {2536#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {2536#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,604 INFO L290 TraceCheckUtils]: 85: Hoare triple {2536#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {2536#false} ~mode5~0 := 0; {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {2536#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {2536#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {2536#false} assume !(node6_~m6~0#1 != ~nomsg~0); {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {2536#false} ~mode6~0 := 0; {2536#false} is VALID [2022-02-20 18:30:58,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {2536#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {2536#false} assume !(0 != ~mode7~0 % 256); {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {2536#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {2536#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {2536#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {2536#false} assume !(0 != ~mode8~0 % 256); {2536#false} is VALID [2022-02-20 18:30:58,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {2536#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 98: Hoare triple {2536#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 99: Hoare triple {2536#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; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 100: Hoare triple {2536#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {2536#false} check_#res#1 := check_~tmp~1#1; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {2536#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2536#false} is VALID [2022-02-20 18:30:58,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {2536#false} assume 0 == assert_~arg#1 % 256; {2536#false} is VALID [2022-02-20 18:30:58,608 INFO L290 TraceCheckUtils]: 104: Hoare triple {2536#false} assume !false; {2536#false} is VALID [2022-02-20 18:30:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:58,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:58,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206991405] [2022-02-20 18:30:58,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206991405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:58,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:58,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:58,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907416274] [2022-02-20 18:30:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:58,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:58,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:58,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:58,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:58,703 INFO L87 Difference]: Start difference. First operand 211 states and 297 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:58,984 INFO L93 Difference]: Finished difference Result 487 states and 737 transitions. [2022-02-20 18:30:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:58,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:30:59,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:59,337 INFO L225 Difference]: With dead ends: 487 [2022-02-20 18:30:59,337 INFO L226 Difference]: Without dead ends: 343 [2022-02-20 18:30:59,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:59,339 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 107 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:59,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-20 18:30:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-02-20 18:30:59,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:59,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,364 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,365 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,376 INFO L93 Difference]: Finished difference Result 343 states and 505 transitions. [2022-02-20 18:30:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 505 transitions. [2022-02-20 18:30:59,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 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 343 states. [2022-02-20 18:30:59,379 INFO L87 Difference]: Start difference. First operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 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 343 states. [2022-02-20 18:30:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,393 INFO L93 Difference]: Finished difference Result 343 states and 505 transitions. [2022-02-20 18:30:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 505 transitions. [2022-02-20 18:30:59,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:59,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2022-02-20 18:30:59,405 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 105 [2022-02-20 18:30:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:59,405 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2022-02-20 18:30:59,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2022-02-20 18:30:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:30:59,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:59,407 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] [2022-02-20 18:30:59,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:30:59,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2022-02-20 18:30:59,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:59,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886565087] [2022-02-20 18:30:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:59,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {4166#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(35, 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]; {4166#true} is VALID [2022-02-20 18:30:59,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {4166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4166#true} is VALID [2022-02-20 18:30:59,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {4166#true} assume 0 == ~r1~0; {4166#true} is VALID [2022-02-20 18:30:59,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {4166#true} assume ~id1~0 >= 0; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {4166#true} assume 0 == ~st1~0; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {4166#true} assume ~send1~0 == ~id1~0; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {4166#true} assume 0 == ~mode1~0 % 256; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {4166#true} assume ~id2~0 >= 0; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {4166#true} assume 0 == ~st2~0; {4166#true} is VALID [2022-02-20 18:30:59,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {4166#true} assume ~send2~0 == ~id2~0; {4166#true} is VALID [2022-02-20 18:30:59,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {4166#true} assume 0 == ~mode2~0 % 256; {4166#true} is VALID [2022-02-20 18:30:59,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {4166#true} assume ~id3~0 >= 0; {4166#true} is VALID [2022-02-20 18:30:59,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {4166#true} assume 0 == ~st3~0; {4166#true} is VALID [2022-02-20 18:30:59,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {4166#true} assume ~send3~0 == ~id3~0; {4166#true} is VALID [2022-02-20 18:30:59,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {4166#true} assume 0 == ~mode3~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,544 INFO L290 TraceCheckUtils]: 55: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {4168#(= (+ (* (- 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;main_~i2~0#1 := 0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4168#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:59,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {4168#(= (+ (* (- 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; {4167#false} is VALID [2022-02-20 18:30:59,561 INFO L290 TraceCheckUtils]: 77: Hoare triple {4167#false} assume !(node3_~m3~0#1 != ~nomsg~0); {4167#false} is VALID [2022-02-20 18:30:59,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {4167#false} ~mode3~0 := 0; {4167#false} is VALID [2022-02-20 18:30:59,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {4167#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {4167#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {4167#false} assume !(node4_~m4~0#1 != ~nomsg~0); {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {4167#false} ~mode4~0 := 0; {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 83: Hoare triple {4167#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 84: Hoare triple {4167#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {4167#false} assume !(node5_~m5~0#1 != ~nomsg~0); {4167#false} is VALID [2022-02-20 18:30:59,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {4167#false} ~mode5~0 := 0; {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 87: Hoare triple {4167#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {4167#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {4167#false} assume !(node6_~m6~0#1 != ~nomsg~0); {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 90: Hoare triple {4167#false} ~mode6~0 := 0; {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {4167#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,563 INFO L290 TraceCheckUtils]: 92: Hoare triple {4167#false} assume !(0 != ~mode7~0 % 256); {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {4167#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {4167#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 95: Hoare triple {4167#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {4167#false} assume !(0 != ~mode8~0 % 256); {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {4167#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {4167#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {4167#false} is VALID [2022-02-20 18:30:59,564 INFO L290 TraceCheckUtils]: 99: Hoare triple {4167#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; {4167#false} is VALID [2022-02-20 18:30:59,565 INFO L290 TraceCheckUtils]: 100: Hoare triple {4167#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {4167#false} is VALID [2022-02-20 18:30:59,565 INFO L290 TraceCheckUtils]: 101: Hoare triple {4167#false} check_#res#1 := check_~tmp~1#1; {4167#false} is VALID [2022-02-20 18:30:59,565 INFO L290 TraceCheckUtils]: 102: Hoare triple {4167#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4167#false} is VALID [2022-02-20 18:30:59,565 INFO L290 TraceCheckUtils]: 103: Hoare triple {4167#false} assume 0 == assert_~arg#1 % 256; {4167#false} is VALID [2022-02-20 18:30:59,565 INFO L290 TraceCheckUtils]: 104: Hoare triple {4167#false} assume !false; {4167#false} is VALID [2022-02-20 18:30:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:59,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:59,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886565087] [2022-02-20 18:30:59,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886565087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:59,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:59,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:59,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775982547] [2022-02-20 18:30:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:59,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:59,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:59,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:59,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:59,660 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,962 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2022-02-20 18:30:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:30:59,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:00,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:00,307 INFO L225 Difference]: With dead ends: 865 [2022-02-20 18:31:00,307 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 18:31:00,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:00,309 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:00,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 412 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 18:31:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2022-02-20 18:31:00,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:00,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,329 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,330 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,347 INFO L93 Difference]: Finished difference Result 591 states and 897 transitions. [2022-02-20 18:31:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 897 transitions. [2022-02-20 18:31:00,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:00,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:00,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:31:00,351 INFO L87 Difference]: Start difference. First operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:31:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,369 INFO L93 Difference]: Finished difference Result 591 states and 897 transitions. [2022-02-20 18:31:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 897 transitions. [2022-02-20 18:31:00,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:00,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:00,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:00,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 896 transitions. [2022-02-20 18:31:00,391 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 896 transitions. Word has length 105 [2022-02-20 18:31:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:00,391 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 896 transitions. [2022-02-20 18:31:00,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 896 transitions. [2022-02-20 18:31:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:00,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:00,392 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] [2022-02-20 18:31:00,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:00,393 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2022-02-20 18:31:00,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:00,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198606221] [2022-02-20 18:31:00,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:00,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:00,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {7029#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(35, 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]; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {7029#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {7029#true} assume 0 == ~r1~0; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {7029#true} assume ~id1~0 >= 0; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {7029#true} assume 0 == ~st1~0; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {7029#true} assume ~send1~0 == ~id1~0; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {7029#true} assume 0 == ~mode1~0 % 256; {7029#true} is VALID [2022-02-20 18:31:00,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {7029#true} assume ~id2~0 >= 0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {7029#true} assume 0 == ~st2~0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {7029#true} assume ~send2~0 == ~id2~0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {7029#true} assume 0 == ~mode2~0 % 256; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {7029#true} assume ~id3~0 >= 0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {7029#true} assume 0 == ~st3~0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {7029#true} assume ~send3~0 == ~id3~0; {7029#true} is VALID [2022-02-20 18:31:00,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {7029#true} assume 0 == ~mode3~0 % 256; {7029#true} is VALID [2022-02-20 18:31:00,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {7029#true} assume ~id4~0 >= 0; {7029#true} is VALID [2022-02-20 18:31:00,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {7029#true} assume 0 == ~st4~0; {7029#true} is VALID [2022-02-20 18:31:00,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {7029#true} assume ~send4~0 == ~id4~0; {7029#true} is VALID [2022-02-20 18:31:00,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {7029#true} assume 0 == ~mode4~0 % 256; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,494 INFO L290 TraceCheckUtils]: 63: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {7031#(= (+ (* (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;main_~i2~0#1 := 0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,499 INFO L290 TraceCheckUtils]: 75: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,500 INFO L290 TraceCheckUtils]: 77: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {7031#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {7031#(= (+ (* (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; {7030#false} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {7030#false} assume !(node4_~m4~0#1 != ~nomsg~0); {7030#false} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {7030#false} ~mode4~0 := 0; {7030#false} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 83: Hoare triple {7030#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,501 INFO L290 TraceCheckUtils]: 84: Hoare triple {7030#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {7030#false} assume !(node5_~m5~0#1 != ~nomsg~0); {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {7030#false} ~mode5~0 := 0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {7030#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {7030#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {7030#false} assume !(node6_~m6~0#1 != ~nomsg~0); {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {7030#false} ~mode6~0 := 0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {7030#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {7030#false} assume !(0 != ~mode7~0 % 256); {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 93: Hoare triple {7030#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 94: Hoare triple {7030#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {7030#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {7030#false} assume !(0 != ~mode8~0 % 256); {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {7030#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {7030#false} is VALID [2022-02-20 18:31:00,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {7030#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 99: Hoare triple {7030#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; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 100: Hoare triple {7030#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 101: Hoare triple {7030#false} check_#res#1 := check_~tmp~1#1; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 102: Hoare triple {7030#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 103: Hoare triple {7030#false} assume 0 == assert_~arg#1 % 256; {7030#false} is VALID [2022-02-20 18:31:00,504 INFO L290 TraceCheckUtils]: 104: Hoare triple {7030#false} assume !false; {7030#false} is VALID [2022-02-20 18:31:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:00,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:00,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198606221] [2022-02-20 18:31:00,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198606221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:00,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:00,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:00,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447192359] [2022-02-20 18:31:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:00,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:00,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:00,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:00,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:00,588 INFO L87 Difference]: Start difference. First operand 589 states and 896 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,983 INFO L93 Difference]: Finished difference Result 1585 states and 2474 transitions. [2022-02-20 18:31:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:00,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:01,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:01,367 INFO L225 Difference]: With dead ends: 1585 [2022-02-20 18:31:01,367 INFO L226 Difference]: Without dead ends: 1063 [2022-02-20 18:31:01,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:01,369 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 99 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:01,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 411 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-02-20 18:31:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-02-20 18:31:01,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:01,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,406 INFO L74 IsIncluded]: Start isIncluded. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,408 INFO L87 Difference]: Start difference. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,459 INFO L93 Difference]: Finished difference Result 1063 states and 1637 transitions. [2022-02-20 18:31:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1637 transitions. [2022-02-20 18:31:01,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:01,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:01,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 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 1063 states. [2022-02-20 18:31:01,465 INFO L87 Difference]: Start difference. First operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 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 1063 states. [2022-02-20 18:31:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,528 INFO L93 Difference]: Finished difference Result 1063 states and 1637 transitions. [2022-02-20 18:31:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1637 transitions. [2022-02-20 18:31:01,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:01,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:01,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:01,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1636 transitions. [2022-02-20 18:31:01,592 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1636 transitions. Word has length 105 [2022-02-20 18:31:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:01,592 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1636 transitions. [2022-02-20 18:31:01,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1636 transitions. [2022-02-20 18:31:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:01,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:01,593 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] [2022-02-20 18:31:01,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:01,594 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:01,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2022-02-20 18:31:01,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:01,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45918568] [2022-02-20 18:31:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:01,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {12248#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(35, 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]; {12248#true} is VALID [2022-02-20 18:31:01,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {12248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12248#true} is VALID [2022-02-20 18:31:01,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {12248#true} assume 0 == ~r1~0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {12248#true} assume ~id1~0 >= 0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {12248#true} assume 0 == ~st1~0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {12248#true} assume ~send1~0 == ~id1~0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {12248#true} assume 0 == ~mode1~0 % 256; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {12248#true} assume ~id2~0 >= 0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {12248#true} assume 0 == ~st2~0; {12248#true} is VALID [2022-02-20 18:31:01,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {12248#true} assume ~send2~0 == ~id2~0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {12248#true} assume 0 == ~mode2~0 % 256; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {12248#true} assume ~id3~0 >= 0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {12248#true} assume 0 == ~st3~0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {12248#true} assume ~send3~0 == ~id3~0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {12248#true} assume 0 == ~mode3~0 % 256; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {12248#true} assume ~id4~0 >= 0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {12248#true} assume 0 == ~st4~0; {12248#true} is VALID [2022-02-20 18:31:01,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {12248#true} assume ~send4~0 == ~id4~0; {12248#true} is VALID [2022-02-20 18:31:01,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {12248#true} assume 0 == ~mode4~0 % 256; {12248#true} is VALID [2022-02-20 18:31:01,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {12248#true} assume ~id5~0 >= 0; {12248#true} is VALID [2022-02-20 18:31:01,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {12248#true} assume 0 == ~st5~0; {12248#true} is VALID [2022-02-20 18:31:01,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {12248#true} assume ~send5~0 == ~id5~0; {12248#true} is VALID [2022-02-20 18:31:01,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {12248#true} assume 0 == ~mode5~0 % 256; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,690 INFO L290 TraceCheckUtils]: 63: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,691 INFO L290 TraceCheckUtils]: 64: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,691 INFO L290 TraceCheckUtils]: 65: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {12250#(= (+ (* (- 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;main_~i2~0#1 := 0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,692 INFO L290 TraceCheckUtils]: 67: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,696 INFO L290 TraceCheckUtils]: 75: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,697 INFO L290 TraceCheckUtils]: 79: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,698 INFO L290 TraceCheckUtils]: 80: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,698 INFO L290 TraceCheckUtils]: 81: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,699 INFO L290 TraceCheckUtils]: 83: Hoare triple {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12250#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 84: Hoare triple {12250#(= (+ (* (- 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; {12249#false} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {12249#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12249#false} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 86: Hoare triple {12249#false} ~mode5~0 := 0; {12249#false} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 87: Hoare triple {12249#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12249#false} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {12249#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12249#false} is VALID [2022-02-20 18:31:01,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {12249#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 90: Hoare triple {12249#false} ~mode6~0 := 0; {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 91: Hoare triple {12249#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 92: Hoare triple {12249#false} assume !(0 != ~mode7~0 % 256); {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 93: Hoare triple {12249#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 94: Hoare triple {12249#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 95: Hoare triple {12249#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 96: Hoare triple {12249#false} assume !(0 != ~mode8~0 % 256); {12249#false} is VALID [2022-02-20 18:31:01,701 INFO L290 TraceCheckUtils]: 97: Hoare triple {12249#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 98: Hoare triple {12249#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 99: Hoare triple {12249#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; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 100: Hoare triple {12249#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 101: Hoare triple {12249#false} check_#res#1 := check_~tmp~1#1; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 102: Hoare triple {12249#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 103: Hoare triple {12249#false} assume 0 == assert_~arg#1 % 256; {12249#false} is VALID [2022-02-20 18:31:01,702 INFO L290 TraceCheckUtils]: 104: Hoare triple {12249#false} assume !false; {12249#false} is VALID [2022-02-20 18:31:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:01,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:01,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45918568] [2022-02-20 18:31:01,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45918568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:01,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:01,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:01,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424444776] [2022-02-20 18:31:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:01,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:01,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:01,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:01,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:01,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:01,792 INFO L87 Difference]: Start difference. First operand 1061 states and 1636 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:02,444 INFO L93 Difference]: Finished difference Result 2953 states and 4614 transitions. [2022-02-20 18:31:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:02,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:02,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:02,975 INFO L225 Difference]: With dead ends: 2953 [2022-02-20 18:31:02,976 INFO L226 Difference]: Without dead ends: 1959 [2022-02-20 18:31:02,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:02,978 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 95 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:02,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 410 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-02-20 18:31:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2022-02-20 18:31:03,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:03,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,042 INFO L74 IsIncluded]: Start isIncluded. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,045 INFO L87 Difference]: Start difference. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,182 INFO L93 Difference]: Finished difference Result 1959 states and 3029 transitions. [2022-02-20 18:31:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3029 transitions. [2022-02-20 18:31:03,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 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 1959 states. [2022-02-20 18:31:03,193 INFO L87 Difference]: Start difference. First operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 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 1959 states. [2022-02-20 18:31:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,314 INFO L93 Difference]: Finished difference Result 1959 states and 3029 transitions. [2022-02-20 18:31:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3029 transitions. [2022-02-20 18:31:03,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:03,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3028 transitions. [2022-02-20 18:31:03,497 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3028 transitions. Word has length 105 [2022-02-20 18:31:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:03,497 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3028 transitions. [2022-02-20 18:31:03,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3028 transitions. [2022-02-20 18:31:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:03,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:03,499 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] [2022-02-20 18:31:03,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:03,499 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2022-02-20 18:31:03,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:03,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722924837] [2022-02-20 18:31:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {21963#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(35, 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]; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {21963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {21963#true} assume 0 == ~r1~0; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {21963#true} assume ~id1~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {21963#true} assume 0 == ~st1~0; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {21963#true} assume ~send1~0 == ~id1~0; {21963#true} is VALID [2022-02-20 18:31:03,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {21963#true} assume 0 == ~mode1~0 % 256; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {21963#true} assume ~id2~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {21963#true} assume 0 == ~st2~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {21963#true} assume ~send2~0 == ~id2~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {21963#true} assume 0 == ~mode2~0 % 256; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {21963#true} assume ~id3~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {21963#true} assume 0 == ~st3~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {21963#true} assume ~send3~0 == ~id3~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {21963#true} assume 0 == ~mode3~0 % 256; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {21963#true} assume ~id4~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {21963#true} assume 0 == ~st4~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {21963#true} assume ~send4~0 == ~id4~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {21963#true} assume 0 == ~mode4~0 % 256; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {21963#true} assume ~id5~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {21963#true} assume 0 == ~st5~0; {21963#true} is VALID [2022-02-20 18:31:03,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {21963#true} assume ~send5~0 == ~id5~0; {21963#true} is VALID [2022-02-20 18:31:03,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {21963#true} assume 0 == ~mode5~0 % 256; {21963#true} is VALID [2022-02-20 18:31:03,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {21963#true} assume ~id6~0 >= 0; {21963#true} is VALID [2022-02-20 18:31:03,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {21963#true} assume 0 == ~st6~0; {21963#true} is VALID [2022-02-20 18:31:03,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {21963#true} assume ~send6~0 == ~id6~0; {21963#true} is VALID [2022-02-20 18:31:03,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {21963#true} assume 0 == ~mode6~0 % 256; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {21965#(= (+ (* (- 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;main_~i2~0#1 := 0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,599 INFO L290 TraceCheckUtils]: 70: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,601 INFO L290 TraceCheckUtils]: 74: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,602 INFO L290 TraceCheckUtils]: 75: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,602 INFO L290 TraceCheckUtils]: 76: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,602 INFO L290 TraceCheckUtils]: 77: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,606 INFO L290 TraceCheckUtils]: 85: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,619 INFO L290 TraceCheckUtils]: 87: Hoare triple {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {21965#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:03,620 INFO L290 TraceCheckUtils]: 88: Hoare triple {21965#(= (+ (* (- 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; {21964#false} is VALID [2022-02-20 18:31:03,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {21964#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21964#false} is VALID [2022-02-20 18:31:03,620 INFO L290 TraceCheckUtils]: 90: Hoare triple {21964#false} ~mode6~0 := 0; {21964#false} is VALID [2022-02-20 18:31:03,620 INFO L290 TraceCheckUtils]: 91: Hoare triple {21964#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {21964#false} is VALID [2022-02-20 18:31:03,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {21964#false} assume !(0 != ~mode7~0 % 256); {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 93: Hoare triple {21964#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 94: Hoare triple {21964#false} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 95: Hoare triple {21964#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {21964#false} assume !(0 != ~mode8~0 % 256); {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {21964#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {21964#false} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 99: Hoare triple {21964#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; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 100: Hoare triple {21964#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 101: Hoare triple {21964#false} check_#res#1 := check_~tmp~1#1; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 102: Hoare triple {21964#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 103: Hoare triple {21964#false} assume 0 == assert_~arg#1 % 256; {21964#false} is VALID [2022-02-20 18:31:03,621 INFO L290 TraceCheckUtils]: 104: Hoare triple {21964#false} assume !false; {21964#false} is VALID [2022-02-20 18:31:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:03,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:03,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722924837] [2022-02-20 18:31:03,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722924837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:03,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:03,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:03,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310680795] [2022-02-20 18:31:03,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:03,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:03,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:03,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:03,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:03,710 INFO L87 Difference]: Start difference. First operand 1957 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:04,892 INFO L93 Difference]: Finished difference Result 5545 states and 8630 transitions. [2022-02-20 18:31:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:04,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:05,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:05,705 INFO L225 Difference]: With dead ends: 5545 [2022-02-20 18:31:05,705 INFO L226 Difference]: Without dead ends: 3655 [2022-02-20 18:31:05,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:05,707 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:05,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 409 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2022-02-20 18:31:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2022-02-20 18:31:05,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:05,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,825 INFO L74 IsIncluded]: Start isIncluded. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,833 INFO L87 Difference]: Start difference. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:06,215 INFO L93 Difference]: Finished difference Result 3655 states and 5637 transitions. [2022-02-20 18:31:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 5637 transitions. [2022-02-20 18:31:06,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:06,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:06,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 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 3655 states. [2022-02-20 18:31:06,231 INFO L87 Difference]: Start difference. First operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 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 3655 states. [2022-02-20 18:31:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:06,632 INFO L93 Difference]: Finished difference Result 3655 states and 5637 transitions. [2022-02-20 18:31:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 5637 transitions. [2022-02-20 18:31:06,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:06,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:06,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:06,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5636 transitions. [2022-02-20 18:31:07,121 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5636 transitions. Word has length 105 [2022-02-20 18:31:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:07,122 INFO L470 AbstractCegarLoop]: Abstraction has 3653 states and 5636 transitions. [2022-02-20 18:31:07,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5636 transitions. [2022-02-20 18:31:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:07,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:07,123 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] [2022-02-20 18:31:07,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:31:07,123 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2022-02-20 18:31:07,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:07,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460433082] [2022-02-20 18:31:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:07,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {40238#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(35, 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]; {40238#true} is VALID [2022-02-20 18:31:07,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {40238#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~post47#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40238#true} is VALID [2022-02-20 18:31:07,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {40238#true} assume 0 == ~r1~0; {40238#true} is VALID [2022-02-20 18:31:07,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {40238#true} assume ~id1~0 >= 0; {40238#true} is VALID [2022-02-20 18:31:07,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {40238#true} assume 0 == ~st1~0; {40240#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:07,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {40240#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {40240#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:07,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {40240#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {40240#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:07,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {40240#(<= ~st1~0 0)} assume ~id2~0 >= 0; {40240#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:07,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {40240#(<= ~st1~0 0)} assume 0 == ~st2~0; {40241#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {40241#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {40241#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {40241#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {40241#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {40241#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {40241#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {40241#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {40242#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {40243#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:07,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {40244#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {40245#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id8~0 >= 0; {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {40246#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~st8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 == ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode8~0 % 256; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,327 INFO L290 TraceCheckUtils]: 51: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,331 INFO L290 TraceCheckUtils]: 59: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,333 INFO L290 TraceCheckUtils]: 63: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !!(main_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,335 INFO L290 TraceCheckUtils]: 68: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,338 INFO L290 TraceCheckUtils]: 74: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,341 INFO L290 TraceCheckUtils]: 80: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,343 INFO L290 TraceCheckUtils]: 84: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,343 INFO L290 TraceCheckUtils]: 85: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,344 INFO L290 TraceCheckUtils]: 86: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,346 INFO L290 TraceCheckUtils]: 91: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,346 INFO L290 TraceCheckUtils]: 92: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,346 INFO L290 TraceCheckUtils]: 93: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,347 INFO L290 TraceCheckUtils]: 94: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,347 INFO L290 TraceCheckUtils]: 95: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode8~0 % 256); {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,352 INFO L290 TraceCheckUtils]: 98: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,352 INFO L290 TraceCheckUtils]: 99: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} 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; {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:07,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {40247#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40239#false} is VALID [2022-02-20 18:31:07,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {40239#false} check_#res#1 := check_~tmp~1#1; {40239#false} is VALID [2022-02-20 18:31:07,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {40239#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40239#false} is VALID [2022-02-20 18:31:07,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {40239#false} assume 0 == assert_~arg#1 % 256; {40239#false} is VALID [2022-02-20 18:31:07,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {40239#false} assume !false; {40239#false} is VALID [2022-02-20 18:31:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:07,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:07,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460433082] [2022-02-20 18:31:07,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460433082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:07,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:07,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:31:07,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401823194] [2022-02-20 18:31:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:07,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:07,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:07,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:07,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:31:07,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:31:07,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:31:07,429 INFO L87 Difference]: Start difference. First operand 3653 states and 5636 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)