./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.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 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:52:29,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:52:29,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:52:29,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:52:29,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:52:29,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:52:29,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:52:29,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:52:29,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:52:29,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:52:29,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:52:29,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:52:29,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:52:29,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:52:29,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:52:29,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:52:29,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:52:29,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:52:29,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:52:29,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:52:29,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:52:29,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:52:29,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:52:29,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:52:29,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:52:29,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:52:29,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:52:29,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:52:29,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:52:29,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:52:29,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:52:29,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:52:29,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:52:29,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:52:29,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:52:29,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:52:29,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:52:29,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:52:29,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:52:29,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:52:29,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:52:29,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:52:29,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:52:29,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:52:29,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:52:29,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:52:29,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:52:29,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:52:29,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:52:29,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:52:29,737 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:52:29,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:52:29,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:52:29,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:52:29,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:52:29,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:52:29,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:52:29,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:52:29,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:52:29,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:52:29,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:52:29,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:52:29,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:52:29,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:52:29,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:52:29,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:52:29,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:29,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:52:29,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:52:29,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:52:29,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:52:29,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:52:29,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:52:29,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:52:29,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:52:29,743 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 -> 814707fd20d5e6c26ff7c37a631e7717aed30ef7e6a1e8c64960ffc8d41abd55 [2022-02-20 19:52:29,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:52:30,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:52:30,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:52:30,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:52:30,006 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:52:30,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-02-20 19:52:30,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4521760c/f1118c871c9e4da8ad2459095e1c9b7a/FLAGa4a19cfcd [2022-02-20 19:52:30,691 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:52:30,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-02-20 19:52:30,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4521760c/f1118c871c9e4da8ad2459095e1c9b7a/FLAGa4a19cfcd [2022-02-20 19:52:30,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4521760c/f1118c871c9e4da8ad2459095e1c9b7a [2022-02-20 19:52:30,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:52:30,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:52:30,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:30,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:52:30,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:52:30,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:30" (1/1) ... [2022-02-20 19:52:30,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a770f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:30, skipping insertion in model container [2022-02-20 19:52:30,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:52:30" (1/1) ... [2022-02-20 19:52:30,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:52:30,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:52:31,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2022-02-20 19:52:31,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2022-02-20 19:52:32,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:32,102 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:52:32,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c[26860,26873] [2022-02-20 19:52:32,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c[33796,33809] [2022-02-20 19:52:32,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:52:32,575 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:52:32,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32 WrapperNode [2022-02-20 19:52:32,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:52:32,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:32,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:52:32,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:52:32,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:32,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,140 INFO L137 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5281 [2022-02-20 19:52:33,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:52:33,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:52:33,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:52:33,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:52:33,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:52:33,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:52:33,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:52:33,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:52:33,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (1/1) ... [2022-02-20 19:52:33,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:52:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:52:33,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:52:33,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:52:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:52:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:52:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:52:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:52:33,770 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:52:33,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:52:41,794 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:52:41,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:52:41,807 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:52:41,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:41 BoogieIcfgContainer [2022-02-20 19:52:41,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:52:41,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:52:41,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:52:41,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:52:41,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:52:30" (1/3) ... [2022-02-20 19:52:41,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ef9395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:41, skipping insertion in model container [2022-02-20 19:52:41,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:52:32" (2/3) ... [2022-02-20 19:52:41,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ef9395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:52:41, skipping insertion in model container [2022-02-20 19:52:41,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:52:41" (3/3) ... [2022-02-20 19:52:41,817 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label05.c [2022-02-20 19:52:41,821 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:52:41,821 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:52:41,863 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:52:41,869 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:52:41,869 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:52:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:52:41,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:41,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:52:41,917 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2107180874, now seen corresponding path program 1 times [2022-02-20 19:52:41,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:41,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833126902] [2022-02-20 19:52:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:42,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {966#true} is VALID [2022-02-20 19:52:42,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {966#true} is VALID [2022-02-20 19:52:42,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {966#true} is VALID [2022-02-20 19:52:42,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {966#true} is VALID [2022-02-20 19:52:42,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#true} init_#res#1 := init_~tmp~0#1; {966#true} is VALID [2022-02-20 19:52:42,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {966#true} is VALID [2022-02-20 19:52:42,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {967#false} is VALID [2022-02-20 19:52:42,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {967#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {967#false} is VALID [2022-02-20 19:52:42,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {967#false} assume !!(main1_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {967#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; {967#false} is VALID [2022-02-20 19:52:42,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {967#false} assume !(node1_~m1~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:52:42,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {967#false} ~mode1~0 := 0; {967#false} is VALID [2022-02-20 19:52:42,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {967#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !(node2_~m2~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:52:42,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} ~mode2~0 := 0; {967#false} is VALID [2022-02-20 19:52:42,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !(node3_~m3~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:52:42,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} ~mode3~0 := 0; {967#false} is VALID [2022-02-20 19:52:42,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} assume !(0 != ~mode4~0 % 256); {967#false} is VALID [2022-02-20 19:52:42,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {967#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {967#false} is VALID [2022-02-20 19:52:42,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {967#false} is VALID [2022-02-20 19:52:42,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !(0 != ~mode5~0 % 256); {967#false} is VALID [2022-02-20 19:52:42,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {967#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {967#false} is VALID [2022-02-20 19:52:42,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {967#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {967#false} is VALID [2022-02-20 19:52:42,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(0 != ~mode6~0 % 256); {967#false} is VALID [2022-02-20 19:52:42,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {967#false} is VALID [2022-02-20 19:52:42,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {967#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {967#false} is VALID [2022-02-20 19:52:42,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {967#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {967#false} assume !(0 != ~mode7~0 % 256); {967#false} is VALID [2022-02-20 19:52:42,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {967#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {967#false} is VALID [2022-02-20 19:52:42,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {967#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {967#false} is VALID [2022-02-20 19:52:42,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {967#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {967#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:52:42,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {967#false} assume !(node8_~m8~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:52:42,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {967#false} ~mode8~0 := 0; {967#false} is VALID [2022-02-20 19:52:42,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {967#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; {967#false} is VALID [2022-02-20 19:52:42,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {967#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {967#false} is VALID [2022-02-20 19:52:42,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {967#false} check_#res#1 := check_~tmp~1#1; {967#false} is VALID [2022-02-20 19:52:42,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {967#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {967#false} is VALID [2022-02-20 19:52:42,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {967#false} assume 0 == assert_~arg#1 % 256; {967#false} is VALID [2022-02-20 19:52:42,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 19:52:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:52:42,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:42,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833126902] [2022-02-20 19:52:42,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833126902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:42,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:42,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:52:42,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651471084] [2022-02-20 19:52:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:52:42,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:42,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:42,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:42,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:52:42,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:52:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:52:42,404 INFO L87 Difference]: Start difference. First operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:43,878 INFO L93 Difference]: Finished difference Result 1859 states and 3512 transitions. [2022-02-20 19:52:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:52:43,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:52:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3512 transitions. [2022-02-20 19:52:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3512 transitions. [2022-02-20 19:52:43,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3512 transitions. [2022-02-20 19:52:46,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3512 edges. 3512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:46,871 INFO L225 Difference]: With dead ends: 1859 [2022-02-20 19:52:46,871 INFO L226 Difference]: Without dead ends: 897 [2022-02-20 19:52:46,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:52:46,880 INFO L933 BasicCegarLoop]: 1755 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:46,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:52:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-02-20 19:52:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-02-20 19:52:46,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:46,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:46,970 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:46,973 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:47,026 INFO L93 Difference]: Finished difference Result 897 states and 1688 transitions. [2022-02-20 19:52:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:52:47,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:47,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:47,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:52:47,044 INFO L87 Difference]: Start difference. First operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:52:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:47,090 INFO L93 Difference]: Finished difference Result 897 states and 1688 transitions. [2022-02-20 19:52:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:52:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:47,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:47,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1688 transitions. [2022-02-20 19:52:47,149 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1688 transitions. Word has length 46 [2022-02-20 19:52:47,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:47,149 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1688 transitions. [2022-02-20 19:52:47,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:52:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:52:47,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:47,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:52:47,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:52:47,160 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-02-20 19:52:47,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:47,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724857088] [2022-02-20 19:52:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:47,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {5574#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5574#true} is VALID [2022-02-20 19:52:47,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {5574#true} is VALID [2022-02-20 19:52:47,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {5574#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5574#true} is VALID [2022-02-20 19:52:47,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {5574#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5576#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:52:47,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {5576#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5577#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:52:47,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {5577#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5578#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:52:47,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {5578#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5575#false} is VALID [2022-02-20 19:52:47,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5575#false} is VALID [2022-02-20 19:52:47,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {5575#false} assume !!(main1_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {5575#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; {5575#false} is VALID [2022-02-20 19:52:47,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {5575#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5575#false} is VALID [2022-02-20 19:52:47,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#false} ~mode1~0 := 0; {5575#false} is VALID [2022-02-20 19:52:47,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {5575#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {5575#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {5575#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5575#false} is VALID [2022-02-20 19:52:47,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {5575#false} ~mode2~0 := 0; {5575#false} is VALID [2022-02-20 19:52:47,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5575#false} is VALID [2022-02-20 19:52:47,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {5575#false} ~mode3~0 := 0; {5575#false} is VALID [2022-02-20 19:52:47,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {5575#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {5575#false} assume !(0 != ~mode4~0 % 256); {5575#false} is VALID [2022-02-20 19:52:47,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {5575#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5575#false} is VALID [2022-02-20 19:52:47,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {5575#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5575#false} is VALID [2022-02-20 19:52:47,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {5575#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {5575#false} assume !(0 != ~mode5~0 % 256); {5575#false} is VALID [2022-02-20 19:52:47,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {5575#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {5575#false} is VALID [2022-02-20 19:52:47,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {5575#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {5575#false} is VALID [2022-02-20 19:52:47,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {5575#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {5575#false} assume !(0 != ~mode6~0 % 256); {5575#false} is VALID [2022-02-20 19:52:47,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {5575#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {5575#false} is VALID [2022-02-20 19:52:47,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {5575#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {5575#false} is VALID [2022-02-20 19:52:47,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {5575#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {5575#false} assume !(0 != ~mode7~0 % 256); {5575#false} is VALID [2022-02-20 19:52:47,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {5575#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {5575#false} is VALID [2022-02-20 19:52:47,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {5575#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {5575#false} is VALID [2022-02-20 19:52:47,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {5575#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {5575#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5575#false} is VALID [2022-02-20 19:52:47,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {5575#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5575#false} is VALID [2022-02-20 19:52:47,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {5575#false} ~mode8~0 := 0; {5575#false} is VALID [2022-02-20 19:52:47,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {5575#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; {5575#false} is VALID [2022-02-20 19:52:47,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {5575#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5575#false} is VALID [2022-02-20 19:52:47,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {5575#false} check_#res#1 := check_~tmp~1#1; {5575#false} is VALID [2022-02-20 19:52:47,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {5575#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5575#false} is VALID [2022-02-20 19:52:47,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {5575#false} assume 0 == assert_~arg#1 % 256; {5575#false} is VALID [2022-02-20 19:52:47,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-02-20 19:52:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:52:47,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:47,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724857088] [2022-02-20 19:52:47,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724857088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:47,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:47,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:52:47,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420267654] [2022-02-20 19:52:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:52:47,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:47,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:47,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:47,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:52:47,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:52:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:52:47,329 INFO L87 Difference]: Start difference. First operand 897 states and 1688 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:51,788 INFO L93 Difference]: Finished difference Result 977 states and 1813 transitions. [2022-02-20 19:52:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:52:51,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:52:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:52:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:52:51,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1813 transitions. [2022-02-20 19:52:53,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1813 edges. 1813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:53,263 INFO L225 Difference]: With dead ends: 977 [2022-02-20 19:52:53,264 INFO L226 Difference]: Without dead ends: 897 [2022-02-20 19:52:53,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:52:53,266 INFO L933 BasicCegarLoop]: 1686 mSDtfsCounter, 3 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:52:53,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6680 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:52:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-02-20 19:52:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-02-20 19:52:53,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:52:53,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,290 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,291 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:53,328 INFO L93 Difference]: Finished difference Result 897 states and 1627 transitions. [2022-02-20 19:52:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:52:53,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:53,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:53,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:52:53,334 INFO L87 Difference]: Start difference. First operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:52:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:52:53,374 INFO L93 Difference]: Finished difference Result 897 states and 1627 transitions. [2022-02-20 19:52:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:52:53,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:52:53,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:52:53,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:52:53,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:52:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1627 transitions. [2022-02-20 19:52:53,418 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1627 transitions. Word has length 46 [2022-02-20 19:52:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:52:53,418 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1627 transitions. [2022-02-20 19:52:53,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:52:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 19:52:53,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:52:53,422 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] [2022-02-20 19:52:53,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:52:53,422 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:52:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:52:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 817411013, now seen corresponding path program 1 times [2022-02-20 19:52:53,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:52:53,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582274212] [2022-02-20 19:52:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:52:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:52:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:52:53,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {9299#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet63#1);havoc main_#t~nondet63#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet61#1, main2_#t~ret62#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet61#1 && main2_#t~nondet61#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet61#1;havoc main2_#t~nondet61#1; {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret58#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:52:53,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {9301#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9302#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:53,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {9302#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9302#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:52:53,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {9302#(not (= 0 (+ (- 13) ~a24~0)))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9300#false} is VALID [2022-02-20 19:52:53,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {9300#false} assume !false; {9300#false} is VALID [2022-02-20 19:52:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:52:53,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:52:53,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582274212] [2022-02-20 19:52:53,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582274212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:52:53,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:52:53,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:52:53,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533604348] [2022-02-20 19:52:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:52:53,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:52:53,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:52:53,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:52:53,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:52:53,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:52:53,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:52:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:52:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:52:53,731 INFO L87 Difference]: Start difference. First operand 897 states and 1627 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:06,148 INFO L93 Difference]: Finished difference Result 3152 states and 5936 transitions. [2022-02-20 19:53:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:53:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 19:53:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5936 transitions. [2022-02-20 19:53:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5936 transitions. [2022-02-20 19:53:06,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5936 transitions. [2022-02-20 19:53:11,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5936 edges. 5936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:11,286 INFO L225 Difference]: With dead ends: 3152 [2022-02-20 19:53:11,286 INFO L226 Difference]: Without dead ends: 2399 [2022-02-20 19:53:11,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:11,288 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 2570 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:11,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2570 Valid, 899 Invalid, 6404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1250 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-20 19:53:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2022-02-20 19:53:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2399. [2022-02-20 19:53:11,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:11,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2399 states. Second operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:11,355 INFO L74 IsIncluded]: Start isIncluded. First operand 2399 states. Second operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:11,359 INFO L87 Difference]: Start difference. First operand 2399 states. Second operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:11,614 INFO L93 Difference]: Finished difference Result 2399 states and 3603 transitions. [2022-02-20 19:53:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3603 transitions. [2022-02-20 19:53:11,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:11,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:11,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 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 2399 states. [2022-02-20 19:53:11,635 INFO L87 Difference]: Start difference. First operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 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 2399 states. [2022-02-20 19:53:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:11,886 INFO L93 Difference]: Finished difference Result 2399 states and 3603 transitions. [2022-02-20 19:53:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3603 transitions. [2022-02-20 19:53:11,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:11,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:11,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:11,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2397 states have (on average 1.5031289111389237) internal successors, (3603), 2398 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3603 transitions. [2022-02-20 19:53:12,167 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3603 transitions. Word has length 60 [2022-02-20 19:53:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:12,168 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 3603 transitions. [2022-02-20 19:53:12,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3603 transitions. [2022-02-20 19:53:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:12,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:12,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:12,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:12,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-02-20 19:53:12,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:12,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785282226] [2022-02-20 19:53:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:12,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {19715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {19715#true} is VALID [2022-02-20 19:53:12,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {19715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {19715#true} is VALID [2022-02-20 19:53:12,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {19715#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19715#true} is VALID [2022-02-20 19:53:12,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {19715#true} assume 0 == ~r1~0; {19715#true} is VALID [2022-02-20 19:53:12,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {19715#true} assume ~id1~0 >= 0; {19715#true} is VALID [2022-02-20 19:53:12,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {19715#true} assume 0 == ~st1~0; {19715#true} is VALID [2022-02-20 19:53:12,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {19715#true} assume ~send1~0 == ~id1~0; {19715#true} is VALID [2022-02-20 19:53:12,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {19715#true} assume 0 == ~mode1~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,362 INFO L290 TraceCheckUtils]: 63: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {19717#(= (+ (* (- 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;main1_~i2~0#1 := 0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19717#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:53:12,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {19717#(= (+ (* (- 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; {19716#false} is VALID [2022-02-20 19:53:12,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {19716#false} assume !(node1_~m1~0#1 != ~nomsg~0); {19716#false} is VALID [2022-02-20 19:53:12,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {19716#false} ~mode1~0 := 0; {19716#false} is VALID [2022-02-20 19:53:12,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {19716#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {19716#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {19716#false} assume !(node2_~m2~0#1 != ~nomsg~0); {19716#false} is VALID [2022-02-20 19:53:12,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {19716#false} ~mode2~0 := 0; {19716#false} is VALID [2022-02-20 19:53:12,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {19716#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {19716#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {19716#false} assume !(node3_~m3~0#1 != ~nomsg~0); {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {19716#false} ~mode3~0 := 0; {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {19716#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {19716#false} assume !(0 != ~mode4~0 % 256); {19716#false} is VALID [2022-02-20 19:53:12,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {19716#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {19716#false} is VALID [2022-02-20 19:53:12,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {19716#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {19716#false} is VALID [2022-02-20 19:53:12,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {19716#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {19716#false} assume !(0 != ~mode5~0 % 256); {19716#false} is VALID [2022-02-20 19:53:12,368 INFO L290 TraceCheckUtils]: 86: Hoare triple {19716#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {19716#false} is VALID [2022-02-20 19:53:12,373 INFO L290 TraceCheckUtils]: 87: Hoare triple {19716#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {19716#false} is VALID [2022-02-20 19:53:12,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {19716#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {19716#false} assume !(0 != ~mode6~0 % 256); {19716#false} is VALID [2022-02-20 19:53:12,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {19716#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {19716#false} is VALID [2022-02-20 19:53:12,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {19716#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {19716#false} is VALID [2022-02-20 19:53:12,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {19716#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {19716#false} assume !(0 != ~mode7~0 % 256); {19716#false} is VALID [2022-02-20 19:53:12,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {19716#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {19716#false} is VALID [2022-02-20 19:53:12,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {19716#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {19716#false} is VALID [2022-02-20 19:53:12,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {19716#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,381 INFO L290 TraceCheckUtils]: 97: Hoare triple {19716#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {19716#false} is VALID [2022-02-20 19:53:12,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {19716#false} assume !(node8_~m8~0#1 != ~nomsg~0); {19716#false} is VALID [2022-02-20 19:53:12,382 INFO L290 TraceCheckUtils]: 99: Hoare triple {19716#false} ~mode8~0 := 0; {19716#false} is VALID [2022-02-20 19:53:12,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {19716#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; {19716#false} is VALID [2022-02-20 19:53:12,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {19716#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {19716#false} is VALID [2022-02-20 19:53:12,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {19716#false} check_#res#1 := check_~tmp~1#1; {19716#false} is VALID [2022-02-20 19:53:12,383 INFO L290 TraceCheckUtils]: 103: Hoare triple {19716#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {19716#false} is VALID [2022-02-20 19:53:12,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {19716#false} assume 0 == assert_~arg#1 % 256; {19716#false} is VALID [2022-02-20 19:53:12,385 INFO L290 TraceCheckUtils]: 105: Hoare triple {19716#false} assume !false; {19716#false} is VALID [2022-02-20 19:53:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:12,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:12,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785282226] [2022-02-20 19:53:12,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785282226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:12,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:12,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:12,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242959146] [2022-02-20 19:53:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:12,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:12,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:12,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:12,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:12,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:12,459 INFO L87 Difference]: Start difference. First operand 2399 states and 3603 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:14,454 INFO L93 Difference]: Finished difference Result 2545 states and 3835 transitions. [2022-02-20 19:53:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:14,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:15,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:16,153 INFO L225 Difference]: With dead ends: 2545 [2022-02-20 19:53:16,153 INFO L226 Difference]: Without dead ends: 2469 [2022-02-20 19:53:16,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:16,155 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1550 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:16,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1550 Valid, 1853 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2022-02-20 19:53:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2022-02-20 19:53:16,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:16,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2469 states. Second operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:16,234 INFO L74 IsIncluded]: Start isIncluded. First operand 2469 states. Second operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:16,238 INFO L87 Difference]: Start difference. First operand 2469 states. Second operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:16,437 INFO L93 Difference]: Finished difference Result 2469 states and 3713 transitions. [2022-02-20 19:53:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3713 transitions. [2022-02-20 19:53:16,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:16,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:16,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 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 2469 states. [2022-02-20 19:53:16,450 INFO L87 Difference]: Start difference. First operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 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 2469 states. [2022-02-20 19:53:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:16,621 INFO L93 Difference]: Finished difference Result 2469 states and 3713 transitions. [2022-02-20 19:53:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3713 transitions. [2022-02-20 19:53:16,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:16,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:16,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:16,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2465 states have (on average 1.5058823529411764) internal successors, (3712), 2466 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3712 transitions. [2022-02-20 19:53:16,809 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3712 transitions. Word has length 106 [2022-02-20 19:53:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:16,809 INFO L470 AbstractCegarLoop]: Abstraction has 2467 states and 3712 transitions. [2022-02-20 19:53:16,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3712 transitions. [2022-02-20 19:53:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:16,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:16,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:16,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:16,811 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash 326222874, now seen corresponding path program 1 times [2022-02-20 19:53:16,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:16,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241515077] [2022-02-20 19:53:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:16,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {29757#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29757#true} is VALID [2022-02-20 19:53:16,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {29757#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {29757#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {29757#true} assume 0 == ~r1~0; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {29757#true} assume ~id1~0 >= 0; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {29757#true} assume 0 == ~st1~0; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {29757#true} assume ~send1~0 == ~id1~0; {29757#true} is VALID [2022-02-20 19:53:16,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {29757#true} assume 0 == ~mode1~0 % 256; {29757#true} is VALID [2022-02-20 19:53:16,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {29757#true} assume ~id2~0 >= 0; {29757#true} is VALID [2022-02-20 19:53:16,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {29757#true} assume 0 == ~st2~0; {29757#true} is VALID [2022-02-20 19:53:16,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {29757#true} assume ~send2~0 == ~id2~0; {29757#true} is VALID [2022-02-20 19:53:16,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {29757#true} assume 0 == ~mode2~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29759#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:16,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {29759#(= (+ (* (- 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; {29758#false} is VALID [2022-02-20 19:53:16,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {29758#false} assume !(node2_~m2~0#1 != ~nomsg~0); {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {29758#false} ~mode2~0 := 0; {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 76: Hoare triple {29758#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 77: Hoare triple {29758#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 78: Hoare triple {29758#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 79: Hoare triple {29758#false} ~mode3~0 := 0; {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 80: Hoare triple {29758#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,966 INFO L290 TraceCheckUtils]: 81: Hoare triple {29758#false} assume !(0 != ~mode4~0 % 256); {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {29758#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {29758#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {29758#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {29758#false} assume !(0 != ~mode5~0 % 256); {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {29758#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {29758#false} is VALID [2022-02-20 19:53:16,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {29758#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {29758#false} is VALID [2022-02-20 19:53:16,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {29758#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {29758#false} assume !(0 != ~mode6~0 % 256); {29758#false} is VALID [2022-02-20 19:53:16,971 INFO L290 TraceCheckUtils]: 90: Hoare triple {29758#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29758#false} is VALID [2022-02-20 19:53:16,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {29758#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {29758#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {29758#false} assume !(0 != ~mode7~0 % 256); {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 94: Hoare triple {29758#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 95: Hoare triple {29758#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {29758#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 97: Hoare triple {29758#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 98: Hoare triple {29758#false} assume !(node8_~m8~0#1 != ~nomsg~0); {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 99: Hoare triple {29758#false} ~mode8~0 := 0; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 100: Hoare triple {29758#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; {29758#false} is VALID [2022-02-20 19:53:16,972 INFO L290 TraceCheckUtils]: 101: Hoare triple {29758#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {29758#false} is VALID [2022-02-20 19:53:16,973 INFO L290 TraceCheckUtils]: 102: Hoare triple {29758#false} check_#res#1 := check_~tmp~1#1; {29758#false} is VALID [2022-02-20 19:53:16,973 INFO L290 TraceCheckUtils]: 103: Hoare triple {29758#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29758#false} is VALID [2022-02-20 19:53:16,973 INFO L290 TraceCheckUtils]: 104: Hoare triple {29758#false} assume 0 == assert_~arg#1 % 256; {29758#false} is VALID [2022-02-20 19:53:16,973 INFO L290 TraceCheckUtils]: 105: Hoare triple {29758#false} assume !false; {29758#false} is VALID [2022-02-20 19:53:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:16,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:16,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241515077] [2022-02-20 19:53:16,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241515077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:16,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:16,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:16,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801133026] [2022-02-20 19:53:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:16,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:16,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:17,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:17,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:17,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:17,044 INFO L87 Difference]: Start difference. First operand 2467 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:18,985 INFO L93 Difference]: Finished difference Result 2743 states and 4152 transitions. [2022-02-20 19:53:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:18,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:18,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:20,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:20,688 INFO L225 Difference]: With dead ends: 2743 [2022-02-20 19:53:20,689 INFO L226 Difference]: Without dead ends: 2599 [2022-02-20 19:53:20,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:20,690 INFO L933 BasicCegarLoop]: 1729 mSDtfsCounter, 1546 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:20,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1546 Valid, 1852 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2022-02-20 19:53:20,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2597. [2022-02-20 19:53:20,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:20,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2599 states. Second operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:20,793 INFO L74 IsIncluded]: Start isIncluded. First operand 2599 states. Second operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:20,796 INFO L87 Difference]: Start difference. First operand 2599 states. Second operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:21,083 INFO L93 Difference]: Finished difference Result 2599 states and 3920 transitions. [2022-02-20 19:53:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3920 transitions. [2022-02-20 19:53:21,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:21,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:21,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 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 2599 states. [2022-02-20 19:53:21,092 INFO L87 Difference]: Start difference. First operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 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 2599 states. [2022-02-20 19:53:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:21,364 INFO L93 Difference]: Finished difference Result 2599 states and 3920 transitions. [2022-02-20 19:53:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3920 transitions. [2022-02-20 19:53:21,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:21,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:21,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:21,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2595 states have (on average 1.5102119460500962) internal successors, (3919), 2596 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3919 transitions. [2022-02-20 19:53:21,618 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3919 transitions. Word has length 106 [2022-02-20 19:53:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:21,618 INFO L470 AbstractCegarLoop]: Abstraction has 2597 states and 3919 transitions. [2022-02-20 19:53:21,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3919 transitions. [2022-02-20 19:53:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:21,619 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:21,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:21,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:53:21,620 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:21,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1573731728, now seen corresponding path program 1 times [2022-02-20 19:53:21,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:21,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039460524] [2022-02-20 19:53:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:21,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {40442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {40442#true} is VALID [2022-02-20 19:53:21,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {40442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet63#1, main_#t~ret64#1, main_#t~ret65#1;assume -2147483648 <= main_#t~nondet63#1 && main_#t~nondet63#1 <= 2147483647; {40442#true} is VALID [2022-02-20 19:53:21,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {40442#true} assume 0 != main_#t~nondet63#1;havoc main_#t~nondet63#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_#t~post48#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40442#true} is VALID [2022-02-20 19:53:21,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {40442#true} assume 0 == ~r1~0; {40442#true} is VALID [2022-02-20 19:53:21,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {40442#true} assume ~id1~0 >= 0; {40442#true} is VALID [2022-02-20 19:53:21,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {40442#true} assume 0 == ~st1~0; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {40442#true} assume ~send1~0 == ~id1~0; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {40442#true} assume 0 == ~mode1~0 % 256; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {40442#true} assume ~id2~0 >= 0; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {40442#true} assume 0 == ~st2~0; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {40442#true} assume ~send2~0 == ~id2~0; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {40442#true} assume 0 == ~mode2~0 % 256; {40442#true} is VALID [2022-02-20 19:53:21,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {40442#true} assume ~id3~0 >= 0; {40442#true} is VALID [2022-02-20 19:53:21,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {40442#true} assume 0 == ~st3~0; {40442#true} is VALID [2022-02-20 19:53:21,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {40442#true} assume ~send3~0 == ~id3~0; {40442#true} is VALID [2022-02-20 19:53:21,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {40442#true} assume 0 == ~mode3~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,733 INFO L290 TraceCheckUtils]: 72: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40444#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:21,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {40444#(= (+ (* (- 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; {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {40443#false} assume !(node3_~m3~0#1 != ~nomsg~0); {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {40443#false} ~mode3~0 := 0; {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {40443#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 81: Hoare triple {40443#false} assume !(0 != ~mode4~0 % 256); {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 82: Hoare triple {40443#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40443#false} is VALID [2022-02-20 19:53:21,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {40443#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {40443#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {40443#false} assume !(0 != ~mode5~0 % 256); {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 86: Hoare triple {40443#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 87: Hoare triple {40443#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 88: Hoare triple {40443#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 89: Hoare triple {40443#false} assume !(0 != ~mode6~0 % 256); {40443#false} is VALID [2022-02-20 19:53:21,737 INFO L290 TraceCheckUtils]: 90: Hoare triple {40443#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {40443#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {40443#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {40443#false} assume !(0 != ~mode7~0 % 256); {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {40443#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {40443#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {40443#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {40443#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 98: Hoare triple {40443#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 99: Hoare triple {40443#false} ~mode8~0 := 0; {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {40443#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; {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 101: Hoare triple {40443#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {40443#false} check_#res#1 := check_~tmp~1#1; {40443#false} is VALID [2022-02-20 19:53:21,739 INFO L290 TraceCheckUtils]: 103: Hoare triple {40443#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40443#false} is VALID [2022-02-20 19:53:21,740 INFO L290 TraceCheckUtils]: 104: Hoare triple {40443#false} assume 0 == assert_~arg#1 % 256; {40443#false} is VALID [2022-02-20 19:53:21,740 INFO L290 TraceCheckUtils]: 105: Hoare triple {40443#false} assume !false; {40443#false} is VALID [2022-02-20 19:53:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:21,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:21,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039460524] [2022-02-20 19:53:21,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039460524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:21,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:21,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:21,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605856569] [2022-02-20 19:53:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:21,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:21,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:21,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:21,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:21,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:21,813 INFO L87 Difference]: Start difference. First operand 2597 states and 3919 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:23,938 INFO L93 Difference]: Finished difference Result 3121 states and 4753 transitions. [2022-02-20 19:53:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:53:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:53:23,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:53:25,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.