./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.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 48c664e7cdd48f925f0c21709ed46b226b726e91974047076ebfec19f49c351c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:56:47,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:56:47,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:56:47,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:56:47,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:56:47,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:56:47,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:56:47,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:56:47,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:56:47,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:56:47,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:56:47,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:56:47,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:56:47,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:56:47,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:56:47,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:56:47,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:56:47,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:56:47,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:56:47,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:56:47,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:56:47,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:56:47,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:56:47,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:56:47,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:56:47,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:56:47,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:56:47,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:56:47,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:56:47,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:56:47,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:56:47,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:56:47,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:56:47,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:56:47,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:56:47,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:56:47,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:56:47,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:56:47,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:56:47,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:56:47,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:56:47,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:56:47,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:56:47,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:56:47,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:56:47,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:56:47,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:56:47,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:56:47,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:56:47,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:56:47,309 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:56:47,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:56:47,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:56:47,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:56:47,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:56:47,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:56:47,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:56:47,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:56:47,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:56:47,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:56:47,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:56:47,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:47,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:56:47,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:56:47,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:56:47,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:56:47,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:56:47,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:56:47,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:56:47,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:56:47,313 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 -> 48c664e7cdd48f925f0c21709ed46b226b726e91974047076ebfec19f49c351c [2022-02-20 18:56:47,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:56:47,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:56:47,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:56:47,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:56:47,559 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:56:47,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2022-02-20 18:56:47,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516cbe207/c668f5d51a28437fbf750920d32090bd/FLAG8d9274720 [2022-02-20 18:56:47,960 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:56:47,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2022-02-20 18:56:47,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516cbe207/c668f5d51a28437fbf750920d32090bd/FLAG8d9274720 [2022-02-20 18:56:48,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516cbe207/c668f5d51a28437fbf750920d32090bd [2022-02-20 18:56:48,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:56:48,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:56:48,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:48,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:56:48,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:56:48,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff0e5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48, skipping insertion in model container [2022-02-20 18:56:48,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:56:48,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:56:48,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c[8604,8617] [2022-02-20 18:56:48,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:48,700 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:56:48,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c[8604,8617] [2022-02-20 18:56:48,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:48,775 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:56:48,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48 WrapperNode [2022-02-20 18:56:48,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:48,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:48,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:56:48,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:56:48,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,834 INFO L137 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 661 [2022-02-20 18:56:48,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:48,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:56:48,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:56:48,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:56:48,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:56:48,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:56:48,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:56:48,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:56:48,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (1/1) ... [2022-02-20 18:56:48,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:56:48,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:56:48,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:56:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:56:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:56:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:56:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:56:49,047 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:56:49,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:56:49,739 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:56:49,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:56:49,745 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:56:49,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:49 BoogieIcfgContainer [2022-02-20 18:56:49,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:56:49,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:56:49,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:56:49,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:56:49,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:56:48" (1/3) ... [2022-02-20 18:56:49,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6027fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:49, skipping insertion in model container [2022-02-20 18:56:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:48" (2/3) ... [2022-02-20 18:56:49,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6027fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:49, skipping insertion in model container [2022-02-20 18:56:49,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:49" (3/3) ... [2022-02-20 18:56:49,751 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2022-02-20 18:56:49,754 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:56:49,754 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:56:49,780 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:56:49,784 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:56:49,784 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:56:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:56:49,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:49,804 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] [2022-02-20 18:56:49,804 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1231322286, now seen corresponding path program 1 times [2022-02-20 18:56:49,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:49,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291751783] [2022-02-20 18:56:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:50,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {160#true} is VALID [2022-02-20 18:56:50,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {160#true} is VALID [2022-02-20 18:56:50,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume 0 == ~r1~0; {160#true} is VALID [2022-02-20 18:56:50,134 INFO L290 TraceCheckUtils]: 3: Hoare triple {160#true} assume ~id1~0 >= 0; {160#true} is VALID [2022-02-20 18:56:50,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {160#true} assume 0 == ~st1~0; {160#true} is VALID [2022-02-20 18:56:50,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} assume ~send1~0 == ~id1~0; {160#true} is VALID [2022-02-20 18:56:50,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {160#true} assume 0 == ~mode1~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,162 INFO L290 TraceCheckUtils]: 53: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {162#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:56:50,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {162#(= (+ (* (- 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);main_~node1__m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {161#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {161#false} ~mode1~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {161#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {161#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {161#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {161#false} ~mode2~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {161#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {161#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {161#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {161#false} ~mode3~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {161#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {161#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {161#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {161#false} ~mode4~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {161#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {161#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {161#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,173 INFO L290 TraceCheckUtils]: 83: Hoare triple {161#false} ~mode5~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {161#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,174 INFO L290 TraceCheckUtils]: 85: Hoare triple {161#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,174 INFO L290 TraceCheckUtils]: 86: Hoare triple {161#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,174 INFO L290 TraceCheckUtils]: 87: Hoare triple {161#false} ~mode6~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,174 INFO L290 TraceCheckUtils]: 88: Hoare triple {161#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,174 INFO L290 TraceCheckUtils]: 89: Hoare triple {161#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {161#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,175 INFO L290 TraceCheckUtils]: 91: Hoare triple {161#false} ~mode7~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,175 INFO L290 TraceCheckUtils]: 92: Hoare triple {161#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,175 INFO L290 TraceCheckUtils]: 93: Hoare triple {161#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {161#false} is VALID [2022-02-20 18:56:50,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {161#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {161#false} is VALID [2022-02-20 18:56:50,176 INFO L290 TraceCheckUtils]: 95: Hoare triple {161#false} ~mode8~0 := 0; {161#false} is VALID [2022-02-20 18:56:50,176 INFO L290 TraceCheckUtils]: 96: Hoare triple {161#false} ~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;havoc main_~check__tmp~0#1; {161#false} is VALID [2022-02-20 18:56:50,176 INFO L290 TraceCheckUtils]: 97: Hoare triple {161#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {161#false} is VALID [2022-02-20 18:56:50,176 INFO L290 TraceCheckUtils]: 98: Hoare triple {161#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {161#false} is VALID [2022-02-20 18:56:50,177 INFO L290 TraceCheckUtils]: 99: Hoare triple {161#false} assume 0 == main_~assert__arg~0#1 % 256; {161#false} is VALID [2022-02-20 18:56:50,177 INFO L290 TraceCheckUtils]: 100: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-02-20 18:56:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:50,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:50,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291751783] [2022-02-20 18:56:50,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291751783] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:50,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:50,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:50,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855502601] [2022-02-20 18:56:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:56:50,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:50,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:50,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:50,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:50,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:50,288 INFO L87 Difference]: Start difference. First operand has 157 states, 155 states have (on average 1.761290322580645) internal successors, (273), 156 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:50,652 INFO L93 Difference]: Finished difference Result 335 states and 554 transitions. [2022-02-20 18:56:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:56:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2022-02-20 18:56:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2022-02-20 18:56:50,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 554 transitions. [2022-02-20 18:56:51,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:51,067 INFO L225 Difference]: With dead ends: 335 [2022-02-20 18:56:51,068 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 18:56:51,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:51,074 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 193 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:51,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 545 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 18:56:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2022-02-20 18:56:51,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:51,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,110 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,110 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:51,120 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2022-02-20 18:56:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2022-02-20 18:56:51,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:51,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:51,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 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 236 states. [2022-02-20 18:56:51,123 INFO L87 Difference]: Start difference. First operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 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 236 states. [2022-02-20 18:56:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:51,130 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2022-02-20 18:56:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2022-02-20 18:56:51,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:51,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:51,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:51,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 233 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 335 transitions. [2022-02-20 18:56:51,140 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 335 transitions. Word has length 101 [2022-02-20 18:56:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:51,140 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 335 transitions. [2022-02-20 18:56:51,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 335 transitions. [2022-02-20 18:56:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:56:51,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:51,143 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] [2022-02-20 18:56:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:56:51,143 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -854475245, now seen corresponding path program 1 times [2022-02-20 18:56:51,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:51,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434507030] [2022-02-20 18:56:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:51,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {1378#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {1378#true} is VALID [2022-02-20 18:56:51,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {1378#true} is VALID [2022-02-20 18:56:51,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1378#true} assume 0 == ~r1~0; {1378#true} is VALID [2022-02-20 18:56:51,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {1378#true} assume ~id1~0 >= 0; {1378#true} is VALID [2022-02-20 18:56:51,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {1378#true} assume 0 == ~st1~0; {1378#true} is VALID [2022-02-20 18:56:51,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {1378#true} assume ~send1~0 == ~id1~0; {1378#true} is VALID [2022-02-20 18:56:51,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {1378#true} assume 0 == ~mode1~0 % 256; {1378#true} is VALID [2022-02-20 18:56:51,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {1378#true} assume ~id2~0 >= 0; {1378#true} is VALID [2022-02-20 18:56:51,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {1378#true} assume 0 == ~st2~0; {1378#true} is VALID [2022-02-20 18:56:51,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1378#true} assume ~send2~0 == ~id2~0; {1378#true} is VALID [2022-02-20 18:56:51,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {1378#true} assume 0 == ~mode2~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:51,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {1380#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {1379#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {1379#false} ~mode2~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {1379#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {1379#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {1379#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {1379#false} ~mode3~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {1379#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {1379#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {1379#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {1379#false} ~mode4~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,367 INFO L290 TraceCheckUtils]: 81: Hoare triple {1379#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {1379#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {1379#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {1379#false} ~mode5~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {1379#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 86: Hoare triple {1379#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,368 INFO L290 TraceCheckUtils]: 87: Hoare triple {1379#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {1379#false} ~mode6~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {1379#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {1379#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,369 INFO L290 TraceCheckUtils]: 91: Hoare triple {1379#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,370 INFO L290 TraceCheckUtils]: 92: Hoare triple {1379#false} ~mode7~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,370 INFO L290 TraceCheckUtils]: 93: Hoare triple {1379#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,370 INFO L290 TraceCheckUtils]: 94: Hoare triple {1379#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 95: Hoare triple {1379#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {1379#false} ~mode8~0 := 0; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {1379#false} ~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;havoc main_~check__tmp~0#1; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 98: Hoare triple {1379#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 99: Hoare triple {1379#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 100: Hoare triple {1379#false} assume 0 == main_~assert__arg~0#1 % 256; {1379#false} is VALID [2022-02-20 18:56:51,371 INFO L290 TraceCheckUtils]: 101: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2022-02-20 18:56:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:51,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:51,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434507030] [2022-02-20 18:56:51,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434507030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:51,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:51,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:51,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531675692] [2022-02-20 18:56:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:56:51,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:51,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:51,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:51,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:51,459 INFO L87 Difference]: Start difference. First operand 234 states and 335 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:51,772 INFO L93 Difference]: Finished difference Result 558 states and 851 transitions. [2022-02-20 18:56:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:56:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:51,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:56:52,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:52,114 INFO L225 Difference]: With dead ends: 558 [2022-02-20 18:56:52,114 INFO L226 Difference]: Without dead ends: 388 [2022-02-20 18:56:52,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:52,117 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 128 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:52,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-02-20 18:56:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2022-02-20 18:56:52,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:52,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,141 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,142 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:52,157 INFO L93 Difference]: Finished difference Result 388 states and 578 transitions. [2022-02-20 18:56:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 578 transitions. [2022-02-20 18:56:52,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:52,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:52,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:56:52,160 INFO L87 Difference]: Start difference. First operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:56:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:52,176 INFO L93 Difference]: Finished difference Result 388 states and 578 transitions. [2022-02-20 18:56:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 578 transitions. [2022-02-20 18:56:52,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:52,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:52,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:52,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.4987012987012986) internal successors, (577), 385 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 577 transitions. [2022-02-20 18:56:52,195 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 577 transitions. Word has length 102 [2022-02-20 18:56:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:52,196 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 577 transitions. [2022-02-20 18:56:52,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 577 transitions. [2022-02-20 18:56:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:56:52,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:52,198 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] [2022-02-20 18:56:52,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:56:52,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1444057759, now seen corresponding path program 1 times [2022-02-20 18:56:52,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:52,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181908412] [2022-02-20 18:56:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:52,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {3426#true} is VALID [2022-02-20 18:56:52,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {3426#true} is VALID [2022-02-20 18:56:52,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {3426#true} assume 0 == ~r1~0; {3426#true} is VALID [2022-02-20 18:56:52,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {3426#true} assume ~id1~0 >= 0; {3426#true} is VALID [2022-02-20 18:56:52,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {3426#true} assume 0 == ~st1~0; {3426#true} is VALID [2022-02-20 18:56:52,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {3426#true} assume ~send1~0 == ~id1~0; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {3426#true} assume 0 == ~mode1~0 % 256; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {3426#true} assume ~id2~0 >= 0; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {3426#true} assume 0 == ~st2~0; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {3426#true} assume ~send2~0 == ~id2~0; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {3426#true} assume 0 == ~mode2~0 % 256; {3426#true} is VALID [2022-02-20 18:56:52,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {3426#true} assume ~id3~0 >= 0; {3426#true} is VALID [2022-02-20 18:56:52,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {3426#true} assume 0 == ~st3~0; {3426#true} is VALID [2022-02-20 18:56:52,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {3426#true} assume ~send3~0 == ~id3~0; {3426#true} is VALID [2022-02-20 18:56:52,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {3426#true} assume 0 == ~mode3~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,360 INFO L290 TraceCheckUtils]: 68: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,363 INFO L290 TraceCheckUtils]: 74: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:52,363 INFO L290 TraceCheckUtils]: 75: Hoare triple {3428#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {3427#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {3427#false} ~mode3~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {3427#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {3427#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {3427#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {3427#false} ~mode4~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {3427#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 83: Hoare triple {3427#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 84: Hoare triple {3427#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {3427#false} ~mode5~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {3427#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {3427#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {3427#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {3427#false} ~mode6~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {3427#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 91: Hoare triple {3427#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {3427#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {3427#false} ~mode7~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 94: Hoare triple {3427#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,366 INFO L290 TraceCheckUtils]: 95: Hoare triple {3427#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 96: Hoare triple {3427#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 97: Hoare triple {3427#false} ~mode8~0 := 0; {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 98: Hoare triple {3427#false} ~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;havoc main_~check__tmp~0#1; {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 99: Hoare triple {3427#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 100: Hoare triple {3427#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3427#false} is VALID [2022-02-20 18:56:52,367 INFO L290 TraceCheckUtils]: 101: Hoare triple {3427#false} assume 0 == main_~assert__arg~0#1 % 256; {3427#false} is VALID [2022-02-20 18:56:52,368 INFO L290 TraceCheckUtils]: 102: Hoare triple {3427#false} assume !false; {3427#false} is VALID [2022-02-20 18:56:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:52,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:52,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181908412] [2022-02-20 18:56:52,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181908412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:52,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:52,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:52,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492340695] [2022-02-20 18:56:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:52,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:56:52,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:52,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:52,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:52,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:52,444 INFO L87 Difference]: Start difference. First operand 386 states and 577 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:52,734 INFO L93 Difference]: Finished difference Result 998 states and 1551 transitions. [2022-02-20 18:56:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:56:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:52,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:56:53,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:53,065 INFO L225 Difference]: With dead ends: 998 [2022-02-20 18:56:53,066 INFO L226 Difference]: Without dead ends: 676 [2022-02-20 18:56:53,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:53,067 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 123 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:53,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 463 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-20 18:56:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 674. [2022-02-20 18:56:53,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:53,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 676 states. Second operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,097 INFO L74 IsIncluded]: Start isIncluded. First operand 676 states. Second operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,097 INFO L87 Difference]: Start difference. First operand 676 states. Second operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:53,114 INFO L93 Difference]: Finished difference Result 676 states and 1034 transitions. [2022-02-20 18:56:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1034 transitions. [2022-02-20 18:56:53,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:53,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:53,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 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 676 states. [2022-02-20 18:56:53,118 INFO L87 Difference]: Start difference. First operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 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 676 states. [2022-02-20 18:56:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:53,135 INFO L93 Difference]: Finished difference Result 676 states and 1034 transitions. [2022-02-20 18:56:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1034 transitions. [2022-02-20 18:56:53,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:53,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:53,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:53,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.534918276374443) internal successors, (1033), 673 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1033 transitions. [2022-02-20 18:56:53,158 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1033 transitions. Word has length 103 [2022-02-20 18:56:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:53,158 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 1033 transitions. [2022-02-20 18:56:53,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1033 transitions. [2022-02-20 18:56:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:56:53,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:53,159 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] [2022-02-20 18:56:53,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:56:53,159 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1302443314, now seen corresponding path program 1 times [2022-02-20 18:56:53,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:53,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074791018] [2022-02-20 18:56:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:53,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {7071#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {7071#true} is VALID [2022-02-20 18:56:53,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {7071#true} is VALID [2022-02-20 18:56:53,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {7071#true} assume 0 == ~r1~0; {7071#true} is VALID [2022-02-20 18:56:53,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {7071#true} assume ~id1~0 >= 0; {7071#true} is VALID [2022-02-20 18:56:53,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {7071#true} assume 0 == ~st1~0; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {7071#true} assume ~send1~0 == ~id1~0; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {7071#true} assume 0 == ~mode1~0 % 256; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {7071#true} assume ~id2~0 >= 0; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {7071#true} assume 0 == ~st2~0; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {7071#true} assume ~send2~0 == ~id2~0; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {7071#true} assume 0 == ~mode2~0 % 256; {7071#true} is VALID [2022-02-20 18:56:53,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {7071#true} assume ~id3~0 >= 0; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {7071#true} assume 0 == ~st3~0; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {7071#true} assume ~send3~0 == ~id3~0; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {7071#true} assume 0 == ~mode3~0 % 256; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {7071#true} assume ~id4~0 >= 0; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#true} assume 0 == ~st4~0; {7071#true} is VALID [2022-02-20 18:56:53,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {7071#true} assume ~send4~0 == ~id4~0; {7071#true} is VALID [2022-02-20 18:56:53,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {7071#true} assume 0 == ~mode4~0 % 256; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:53,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {7073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {7072#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {7072#false} is VALID [2022-02-20 18:56:53,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {7072#false} ~mode4~0 := 0; {7072#false} is VALID [2022-02-20 18:56:53,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {7072#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {7072#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {7072#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {7072#false} ~mode5~0 := 0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {7072#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {7072#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {7072#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 90: Hoare triple {7072#false} ~mode6~0 := 0; {7072#false} is VALID [2022-02-20 18:56:53,268 INFO L290 TraceCheckUtils]: 91: Hoare triple {7072#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 92: Hoare triple {7072#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {7072#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {7072#false} ~mode7~0 := 0; {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 95: Hoare triple {7072#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 96: Hoare triple {7072#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 97: Hoare triple {7072#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {7072#false} is VALID [2022-02-20 18:56:53,269 INFO L290 TraceCheckUtils]: 98: Hoare triple {7072#false} ~mode8~0 := 0; {7072#false} is VALID [2022-02-20 18:56:53,270 INFO L290 TraceCheckUtils]: 99: Hoare triple {7072#false} ~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;havoc main_~check__tmp~0#1; {7072#false} is VALID [2022-02-20 18:56:53,270 INFO L290 TraceCheckUtils]: 100: Hoare triple {7072#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {7072#false} is VALID [2022-02-20 18:56:53,270 INFO L290 TraceCheckUtils]: 101: Hoare triple {7072#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7072#false} is VALID [2022-02-20 18:56:53,270 INFO L290 TraceCheckUtils]: 102: Hoare triple {7072#false} assume 0 == main_~assert__arg~0#1 % 256; {7072#false} is VALID [2022-02-20 18:56:53,270 INFO L290 TraceCheckUtils]: 103: Hoare triple {7072#false} assume !false; {7072#false} is VALID [2022-02-20 18:56:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:53,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:53,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074791018] [2022-02-20 18:56:53,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074791018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:53,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:53,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:53,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516063055] [2022-02-20 18:56:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:56:53,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:53,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:53,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:53,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:53,343 INFO L87 Difference]: Start difference. First operand 674 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:53,726 INFO L93 Difference]: Finished difference Result 1830 states and 2867 transitions. [2022-02-20 18:56:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:56:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:53,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:56:54,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:54,099 INFO L225 Difference]: With dead ends: 1830 [2022-02-20 18:56:54,099 INFO L226 Difference]: Without dead ends: 1220 [2022-02-20 18:56:54,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:54,101 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 118 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:54,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-02-20 18:56:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2022-02-20 18:56:54,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:54,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1220 states. Second operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,143 INFO L74 IsIncluded]: Start isIncluded. First operand 1220 states. Second operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,145 INFO L87 Difference]: Start difference. First operand 1220 states. Second operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:54,189 INFO L93 Difference]: Finished difference Result 1220 states and 1890 transitions. [2022-02-20 18:56:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1890 transitions. [2022-02-20 18:56:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:54,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:54,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 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 1220 states. [2022-02-20 18:56:54,195 INFO L87 Difference]: Start difference. First operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 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 1220 states. [2022-02-20 18:56:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:54,239 INFO L93 Difference]: Finished difference Result 1220 states and 1890 transitions. [2022-02-20 18:56:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1890 transitions. [2022-02-20 18:56:54,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:54,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:54,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:54,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.552177485620378) internal successors, (1889), 1217 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1889 transitions. [2022-02-20 18:56:54,300 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1889 transitions. Word has length 104 [2022-02-20 18:56:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:54,301 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1889 transitions. [2022-02-20 18:56:54,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1889 transitions. [2022-02-20 18:56:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:56:54,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:54,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:54,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:56:54,302 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash 342678280, now seen corresponding path program 1 times [2022-02-20 18:56:54,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:54,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864709911] [2022-02-20 18:56:54,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:54,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {13736#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {13736#true} is VALID [2022-02-20 18:56:54,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {13736#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {13736#true} assume 0 == ~r1~0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {13736#true} assume ~id1~0 >= 0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {13736#true} assume 0 == ~st1~0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {13736#true} assume ~send1~0 == ~id1~0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {13736#true} assume 0 == ~mode1~0 % 256; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {13736#true} assume ~id2~0 >= 0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {13736#true} assume 0 == ~st2~0; {13736#true} is VALID [2022-02-20 18:56:54,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {13736#true} assume ~send2~0 == ~id2~0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {13736#true} assume 0 == ~mode2~0 % 256; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {13736#true} assume ~id3~0 >= 0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {13736#true} assume 0 == ~st3~0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {13736#true} assume ~send3~0 == ~id3~0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {13736#true} assume 0 == ~mode3~0 % 256; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {13736#true} assume ~id4~0 >= 0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {13736#true} assume 0 == ~st4~0; {13736#true} is VALID [2022-02-20 18:56:54,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {13736#true} assume ~send4~0 == ~id4~0; {13736#true} is VALID [2022-02-20 18:56:54,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {13736#true} assume 0 == ~mode4~0 % 256; {13736#true} is VALID [2022-02-20 18:56:54,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {13736#true} assume ~id5~0 >= 0; {13736#true} is VALID [2022-02-20 18:56:54,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {13736#true} assume 0 == ~st5~0; {13736#true} is VALID [2022-02-20 18:56:54,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {13736#true} assume ~send5~0 == ~id5~0; {13736#true} is VALID [2022-02-20 18:56:54,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {13736#true} assume 0 == ~mode5~0 % 256; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,387 INFO L290 TraceCheckUtils]: 55: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0); {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,410 INFO L290 TraceCheckUtils]: 71: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,412 INFO L290 TraceCheckUtils]: 75: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,412 INFO L290 TraceCheckUtils]: 76: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,412 INFO L290 TraceCheckUtils]: 77: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,413 INFO L290 TraceCheckUtils]: 79: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0); {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,415 INFO L290 TraceCheckUtils]: 82: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,415 INFO L290 TraceCheckUtils]: 83: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:54,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {13738#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {13737#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {13737#false} is VALID [2022-02-20 18:56:54,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {13737#false} ~mode5~0 := 0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 88: Hoare triple {13737#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {13737#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 90: Hoare triple {13737#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 91: Hoare triple {13737#false} ~mode6~0 := 0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {13737#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {13737#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {13737#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 95: Hoare triple {13737#false} ~mode7~0 := 0; {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 96: Hoare triple {13737#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 97: Hoare triple {13737#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {13737#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 99: Hoare triple {13737#false} ~mode8~0 := 0; {13737#false} is VALID [2022-02-20 18:56:54,418 INFO L290 TraceCheckUtils]: 100: Hoare triple {13737#false} ~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;havoc main_~check__tmp~0#1; {13737#false} is VALID [2022-02-20 18:56:54,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {13737#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {13737#false} is VALID [2022-02-20 18:56:54,419 INFO L290 TraceCheckUtils]: 102: Hoare triple {13737#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {13737#false} is VALID [2022-02-20 18:56:54,419 INFO L290 TraceCheckUtils]: 103: Hoare triple {13737#false} assume 0 == main_~assert__arg~0#1 % 256; {13737#false} is VALID [2022-02-20 18:56:54,419 INFO L290 TraceCheckUtils]: 104: Hoare triple {13737#false} assume !false; {13737#false} is VALID [2022-02-20 18:56:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:54,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:54,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864709911] [2022-02-20 18:56:54,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864709911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:54,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:54,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:54,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74024800] [2022-02-20 18:56:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-20 18:56:54,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:54,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:54,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:54,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:54,500 INFO L87 Difference]: Start difference. First operand 1218 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:55,291 INFO L93 Difference]: Finished difference Result 3398 states and 5331 transitions. [2022-02-20 18:56:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-20 18:56:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:55,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:56:55,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:55,792 INFO L225 Difference]: With dead ends: 3398 [2022-02-20 18:56:55,793 INFO L226 Difference]: Without dead ends: 2244 [2022-02-20 18:56:55,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:55,795 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 113 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:55,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2022-02-20 18:56:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2242. [2022-02-20 18:56:55,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:55,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2244 states. Second operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,885 INFO L74 IsIncluded]: Start isIncluded. First operand 2244 states. Second operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,889 INFO L87 Difference]: Start difference. First operand 2244 states. Second operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:56,035 INFO L93 Difference]: Finished difference Result 2244 states and 3490 transitions. [2022-02-20 18:56:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3490 transitions. [2022-02-20 18:56:56,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:56,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:56,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 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 2244 states. [2022-02-20 18:56:56,047 INFO L87 Difference]: Start difference. First operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 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 2244 states. [2022-02-20 18:56:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:56,189 INFO L93 Difference]: Finished difference Result 2244 states and 3490 transitions. [2022-02-20 18:56:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3490 transitions. [2022-02-20 18:56:56,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:56,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:56,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:56,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.5568942436412316) internal successors, (3489), 2241 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3489 transitions. [2022-02-20 18:56:56,400 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3489 transitions. Word has length 105 [2022-02-20 18:56:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:56,401 INFO L470 AbstractCegarLoop]: Abstraction has 2242 states and 3489 transitions. [2022-02-20 18:56:56,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3489 transitions. [2022-02-20 18:56:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 18:56:56,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:56,402 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 18:56:56,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:56:56,403 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 504937094, now seen corresponding path program 1 times [2022-02-20 18:56:56,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:56,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359559744] [2022-02-20 18:56:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:56,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {26093#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {26093#true} is VALID [2022-02-20 18:56:56,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {26093#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {26093#true} assume 0 == ~r1~0; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {26093#true} assume ~id1~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {26093#true} assume 0 == ~st1~0; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {26093#true} assume ~send1~0 == ~id1~0; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {26093#true} assume 0 == ~mode1~0 % 256; {26093#true} is VALID [2022-02-20 18:56:56,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {26093#true} assume ~id2~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {26093#true} assume 0 == ~st2~0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {26093#true} assume ~send2~0 == ~id2~0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {26093#true} assume 0 == ~mode2~0 % 256; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {26093#true} assume ~id3~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {26093#true} assume 0 == ~st3~0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {26093#true} assume ~send3~0 == ~id3~0; {26093#true} is VALID [2022-02-20 18:56:56,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {26093#true} assume 0 == ~mode3~0 % 256; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {26093#true} assume ~id4~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {26093#true} assume 0 == ~st4~0; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {26093#true} assume ~send4~0 == ~id4~0; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {26093#true} assume 0 == ~mode4~0 % 256; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {26093#true} assume ~id5~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {26093#true} assume 0 == ~st5~0; {26093#true} is VALID [2022-02-20 18:56:56,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {26093#true} assume ~send5~0 == ~id5~0; {26093#true} is VALID [2022-02-20 18:56:56,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {26093#true} assume 0 == ~mode5~0 % 256; {26093#true} is VALID [2022-02-20 18:56:56,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {26093#true} assume ~id6~0 >= 0; {26093#true} is VALID [2022-02-20 18:56:56,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {26093#true} assume 0 == ~st6~0; {26093#true} is VALID [2022-02-20 18:56:56,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {26093#true} assume ~send6~0 == ~id6~0; {26093#true} is VALID [2022-02-20 18:56:56,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {26093#true} assume 0 == ~mode6~0 % 256; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,525 INFO L290 TraceCheckUtils]: 55: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,527 INFO L290 TraceCheckUtils]: 60: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0); {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0); {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,533 INFO L290 TraceCheckUtils]: 76: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,533 INFO L290 TraceCheckUtils]: 77: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,535 INFO L290 TraceCheckUtils]: 80: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~nomsg~0); {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,537 INFO L290 TraceCheckUtils]: 86: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,537 INFO L290 TraceCheckUtils]: 87: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,538 INFO L290 TraceCheckUtils]: 89: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {26095#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {26094#false} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {26094#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {26094#false} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {26094#false} ~mode6~0 := 0; {26094#false} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {26094#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {26094#false} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {26094#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {26094#false} is VALID [2022-02-20 18:56:56,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {26094#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {26094#false} ~mode7~0 := 0; {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {26094#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {26094#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 99: Hoare triple {26094#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {26094#false} ~mode8~0 := 0; {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {26094#false} ~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;havoc main_~check__tmp~0#1; {26094#false} is VALID [2022-02-20 18:56:56,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {26094#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {26094#false} is VALID [2022-02-20 18:56:56,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {26094#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {26094#false} is VALID [2022-02-20 18:56:56,541 INFO L290 TraceCheckUtils]: 104: Hoare triple {26094#false} assume 0 == main_~assert__arg~0#1 % 256; {26094#false} is VALID [2022-02-20 18:56:56,541 INFO L290 TraceCheckUtils]: 105: Hoare triple {26094#false} assume !false; {26094#false} is VALID [2022-02-20 18:56:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:56:56,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:56,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359559744] [2022-02-20 18:56:56,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359559744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:56,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:56,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:56,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632485110] [2022-02-20 18:56:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:56,543 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 18:56:56,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:56,544 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 18:56:56,628 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 18:56:56,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:56,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:56,630 INFO L87 Difference]: Start difference. First operand 2242 states and 3489 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 18:56:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:58,586 INFO L93 Difference]: Finished difference Result 6342 states and 9923 transitions. [2022-02-20 18:56:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:58,586 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 18:56:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:58,587 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 18:56:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:58,589 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 18:56:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:56:58,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:56:58,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:59,575 INFO L225 Difference]: With dead ends: 6342 [2022-02-20 18:56:59,576 INFO L226 Difference]: Without dead ends: 4164 [2022-02-20 18:56:59,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:59,579 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 108 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:56:59,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 451 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2022-02-20 18:56:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 4162. [2022-02-20 18:56:59,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:59,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4164 states. Second operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:59,707 INFO L74 IsIncluded]: Start isIncluded. First operand 4164 states. Second operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:59,712 INFO L87 Difference]: Start difference. First operand 4164 states. Second operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:00,198 INFO L93 Difference]: Finished difference Result 4164 states and 6466 transitions. [2022-02-20 18:57:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6466 transitions. [2022-02-20 18:57:00,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:00,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:00,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 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 4164 states. [2022-02-20 18:57:00,214 INFO L87 Difference]: Start difference. First operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 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 4164 states. [2022-02-20 18:57:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:00,691 INFO L93 Difference]: Finished difference Result 4164 states and 6466 transitions. [2022-02-20 18:57:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 6466 transitions. [2022-02-20 18:57:00,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:00,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:00,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:00,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 4161 states have (on average 1.5537130497476568) internal successors, (6465), 4161 states have internal predecessors, (6465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 6465 transitions. [2022-02-20 18:57:01,424 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 6465 transitions. Word has length 106 [2022-02-20 18:57:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:01,424 INFO L470 AbstractCegarLoop]: Abstraction has 4162 states and 6465 transitions. [2022-02-20 18:57:01,424 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 18:57:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 6465 transitions. [2022-02-20 18:57:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 18:57:01,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:01,425 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, 1] [2022-02-20 18:57:01,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:57:01,426 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash -37721726, now seen corresponding path program 1 times [2022-02-20 18:57:01,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:01,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847955615] [2022-02-20 18:57:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:01,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {49138#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {49138#true} is VALID [2022-02-20 18:57:01,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {49138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {49138#true} is VALID [2022-02-20 18:57:01,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {49138#true} assume 0 == ~r1~0; {49138#true} is VALID [2022-02-20 18:57:01,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {49138#true} assume ~id1~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {49138#true} assume 0 == ~st1~0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {49138#true} assume ~send1~0 == ~id1~0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {49138#true} assume 0 == ~mode1~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {49138#true} assume ~id2~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {49138#true} assume 0 == ~st2~0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {49138#true} assume ~send2~0 == ~id2~0; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {49138#true} assume 0 == ~mode2~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {49138#true} assume ~id3~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {49138#true} assume 0 == ~st3~0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {49138#true} assume ~send3~0 == ~id3~0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {49138#true} assume 0 == ~mode3~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {49138#true} assume ~id4~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {49138#true} assume 0 == ~st4~0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {49138#true} assume ~send4~0 == ~id4~0; {49138#true} is VALID [2022-02-20 18:57:01,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {49138#true} assume 0 == ~mode4~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {49138#true} assume ~id5~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {49138#true} assume 0 == ~st5~0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {49138#true} assume ~send5~0 == ~id5~0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {49138#true} assume 0 == ~mode5~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {49138#true} assume ~id6~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {49138#true} assume 0 == ~st6~0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {49138#true} assume ~send6~0 == ~id6~0; {49138#true} is VALID [2022-02-20 18:57:01,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {49138#true} assume 0 == ~mode6~0 % 256; {49138#true} is VALID [2022-02-20 18:57:01,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {49138#true} assume ~id7~0 >= 0; {49138#true} is VALID [2022-02-20 18:57:01,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {49138#true} assume 0 == ~st7~0; {49138#true} is VALID [2022-02-20 18:57:01,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {49138#true} assume ~send7~0 == ~id7~0; {49138#true} is VALID [2022-02-20 18:57:01,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {49138#true} assume 0 == ~mode7~0 % 256; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,502 INFO L290 TraceCheckUtils]: 62: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,503 INFO L290 TraceCheckUtils]: 66: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send1~0 != ~nomsg~0); {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,504 INFO L290 TraceCheckUtils]: 67: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,504 INFO L290 TraceCheckUtils]: 68: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,504 INFO L290 TraceCheckUtils]: 69: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,505 INFO L290 TraceCheckUtils]: 71: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send2~0 != ~nomsg~0); {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send3~0 != ~nomsg~0); {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,508 INFO L290 TraceCheckUtils]: 79: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,509 INFO L290 TraceCheckUtils]: 81: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send4~0 != ~nomsg~0); {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,512 INFO L290 TraceCheckUtils]: 87: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,513 INFO L290 TraceCheckUtils]: 91: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send6~0 != ~nomsg~0); {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,514 INFO L290 TraceCheckUtils]: 94: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:57:01,515 INFO L290 TraceCheckUtils]: 95: Hoare triple {49140#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {49139#false} is VALID [2022-02-20 18:57:01,515 INFO L290 TraceCheckUtils]: 96: Hoare triple {49139#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {49139#false} is VALID [2022-02-20 18:57:01,515 INFO L290 TraceCheckUtils]: 97: Hoare triple {49139#false} ~mode7~0 := 0; {49139#false} is VALID [2022-02-20 18:57:01,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {49139#false} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {49139#false} is VALID [2022-02-20 18:57:01,515 INFO L290 TraceCheckUtils]: 99: Hoare triple {49139#false} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 100: Hoare triple {49139#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 101: Hoare triple {49139#false} ~mode8~0 := 0; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 102: Hoare triple {49139#false} ~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;havoc main_~check__tmp~0#1; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 103: Hoare triple {49139#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 104: Hoare triple {49139#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {49139#false} assume 0 == main_~assert__arg~0#1 % 256; {49139#false} is VALID [2022-02-20 18:57:01,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {49139#false} assume !false; {49139#false} is VALID [2022-02-20 18:57:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:57:01,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:01,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847955615] [2022-02-20 18:57:01,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847955615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:01,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:01,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:01,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106735901] [2022-02-20 18:57:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:57:01,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:01,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:01,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:01,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:01,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:01,617 INFO L87 Difference]: Start difference. First operand 4162 states and 6465 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:07,359 INFO L93 Difference]: Finished difference Result 11846 states and 18435 transitions. [2022-02-20 18:57:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:57:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:57:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:57:07,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:57:07,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:10,038 INFO L225 Difference]: With dead ends: 11846 [2022-02-20 18:57:10,038 INFO L226 Difference]: Without dead ends: 7748 [2022-02-20 18:57:10,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:10,043 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 103 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:10,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2022-02-20 18:57:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 7746. [2022-02-20 18:57:10,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:10,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7748 states. Second operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:10,335 INFO L74 IsIncluded]: Start isIncluded. First operand 7748 states. Second operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:10,345 INFO L87 Difference]: Start difference. First operand 7748 states. Second operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:12,091 INFO L93 Difference]: Finished difference Result 7748 states and 11970 transitions. [2022-02-20 18:57:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 11970 transitions. [2022-02-20 18:57:12,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:12,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:12,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 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 7748 states. [2022-02-20 18:57:12,117 INFO L87 Difference]: Start difference. First operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 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 7748 states. [2022-02-20 18:57:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:13,890 INFO L93 Difference]: Finished difference Result 7748 states and 11970 transitions. [2022-02-20 18:57:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 11970 transitions. [2022-02-20 18:57:13,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:13,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:13,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:13,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7746 states, 7745 states have (on average 1.5453841187863138) internal successors, (11969), 7745 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7746 states to 7746 states and 11969 transitions. [2022-02-20 18:57:16,418 INFO L78 Accepts]: Start accepts. Automaton has 7746 states and 11969 transitions. Word has length 107 [2022-02-20 18:57:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:16,418 INFO L470 AbstractCegarLoop]: Abstraction has 7746 states and 11969 transitions. [2022-02-20 18:57:16,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7746 states and 11969 transitions. [2022-02-20 18:57:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-02-20 18:57:16,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:16,420 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, 1, 1] [2022-02-20 18:57:16,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:57:16,420 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1757696618, now seen corresponding path program 1 times [2022-02-20 18:57:16,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:16,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637623560] [2022-02-20 18:57:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:16,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {92167#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(51, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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];~__return_61349~0 := 0;~__return_61520~0 := 0;~__return_61637~0 := 0; {92167#true} is VALID [2022-02-20 18:57:16,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {92167#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node8____CPAchecker_TMP_0~0#1, main_~node8__m8~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id8~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st8~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send8~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode8~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_~init__tmp~0#1; {92167#true} is VALID [2022-02-20 18:57:16,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {92167#true} assume 0 == ~r1~0; {92167#true} is VALID [2022-02-20 18:57:16,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {92167#true} assume ~id1~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {92167#true} assume 0 == ~st1~0; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {92167#true} assume ~send1~0 == ~id1~0; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {92167#true} assume 0 == ~mode1~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {92167#true} assume ~id2~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {92167#true} assume 0 == ~st2~0; {92167#true} is VALID [2022-02-20 18:57:16,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {92167#true} assume ~send2~0 == ~id2~0; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {92167#true} assume 0 == ~mode2~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {92167#true} assume ~id3~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {92167#true} assume 0 == ~st3~0; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {92167#true} assume ~send3~0 == ~id3~0; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {92167#true} assume 0 == ~mode3~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {92167#true} assume ~id4~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {92167#true} assume 0 == ~st4~0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {92167#true} assume ~send4~0 == ~id4~0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {92167#true} assume 0 == ~mode4~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {92167#true} assume ~id5~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {92167#true} assume 0 == ~st5~0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {92167#true} assume ~send5~0 == ~id5~0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {92167#true} assume 0 == ~mode5~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {92167#true} assume ~id6~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {92167#true} assume 0 == ~st6~0; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {92167#true} assume ~send6~0 == ~id6~0; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {92167#true} assume 0 == ~mode6~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {92167#true} assume ~id7~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {92167#true} assume 0 == ~st7~0; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {92167#true} assume ~send7~0 == ~id7~0; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {92167#true} assume 0 == ~mode7~0 % 256; {92167#true} is VALID [2022-02-20 18:57:16,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {92167#true} assume ~id8~0 >= 0; {92167#true} is VALID [2022-02-20 18:57:16,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {92167#true} assume 0 == ~st8~0; {92167#true} is VALID [2022-02-20 18:57:16,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {92167#true} assume ~send8~0 == ~id8~0; {92167#true} is VALID [2022-02-20 18:57:16,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {92167#true} assume 0 == ~mode8~0 % 256; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;main_~init__tmp~0#1 := 1;~__return_61349~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_61349~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume main_~main__i2~0#1 < 16;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send1~0 != ~nomsg~0); {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,554 INFO L290 TraceCheckUtils]: 71: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send2~0 != ~nomsg~0); {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,555 INFO L290 TraceCheckUtils]: 72: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,555 INFO L290 TraceCheckUtils]: 73: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,556 INFO L290 TraceCheckUtils]: 75: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,556 INFO L290 TraceCheckUtils]: 76: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send3~0 != ~nomsg~0); {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,558 INFO L290 TraceCheckUtils]: 80: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,558 INFO L290 TraceCheckUtils]: 81: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send4~0 != ~nomsg~0); {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,559 INFO L290 TraceCheckUtils]: 82: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,559 INFO L290 TraceCheckUtils]: 83: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,559 INFO L290 TraceCheckUtils]: 84: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send5~0 != ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,561 INFO L290 TraceCheckUtils]: 87: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,561 INFO L290 TraceCheckUtils]: 88: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,566 INFO L290 TraceCheckUtils]: 90: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,569 INFO L290 TraceCheckUtils]: 91: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(~send6~0 != ~nomsg~0); {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,570 INFO L290 TraceCheckUtils]: 92: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,570 INFO L290 TraceCheckUtils]: 93: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,571 INFO L290 TraceCheckUtils]: 94: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,571 INFO L290 TraceCheckUtils]: 95: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !!(0 == ~mode7~0 % 256);havoc main_~node7____CPAchecker_TMP_0~0#1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,572 INFO L290 TraceCheckUtils]: 96: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send7~0 != ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,572 INFO L290 TraceCheckUtils]: 97: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~p7_new~0 == ~nomsg~0;main_~node7____CPAchecker_TMP_0~0#1 := ~send7~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,572 INFO L290 TraceCheckUtils]: 98: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p7_new~0 := (if main_~node7____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node7____CPAchecker_TMP_0~0#1 % 256 else main_~node7____CPAchecker_TMP_0~0#1 % 256 - 256);~mode7~0 := 1; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} havoc main_~node8__m8~0#1;main_~node8__m8~0#1 := ~nomsg~0; {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:57:16,573 INFO L290 TraceCheckUtils]: 100: Hoare triple {92169#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == ~mode8~0 % 256);main_~node8__m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {92168#false} assume !(main_~node8__m8~0#1 != ~nomsg~0); {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 102: Hoare triple {92168#false} ~mode8~0 := 0; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 103: Hoare triple {92168#false} ~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;havoc main_~check__tmp~0#1; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 104: Hoare triple {92168#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);main_~check__tmp~0#1 := 0; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {92168#false} ~__return_61520~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_61520~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {92168#false} assume 0 == main_~assert__arg~0#1 % 256; {92168#false} is VALID [2022-02-20 18:57:16,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {92168#false} assume !false; {92168#false} is VALID [2022-02-20 18:57:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:57:16,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:16,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637623560] [2022-02-20 18:57:16,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637623560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:16,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:16,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:16,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234550512] [2022-02-20 18:57:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:16,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-02-20 18:57:16,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:16,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:16,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:16,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:16,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:16,663 INFO L87 Difference]: Start difference. First operand 7746 states and 11969 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:37,724 INFO L93 Difference]: Finished difference Result 22086 states and 34115 transitions. [2022-02-20 18:57:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:37,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-02-20 18:57:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:57:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-02-20 18:57:37,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 480 transitions. [2022-02-20 18:57:37,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:45,902 INFO L225 Difference]: With dead ends: 22086 [2022-02-20 18:57:45,910 INFO L226 Difference]: Without dead ends: 14404 [2022-02-20 18:57:45,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:45,919 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 98 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:45,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14404 states. [2022-02-20 18:57:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14404 to 14402. [2022-02-20 18:57:46,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:46,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14404 states. Second operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:46,798 INFO L74 IsIncluded]: Start isIncluded. First operand 14404 states. Second operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:46,819 INFO L87 Difference]: Start difference. First operand 14404 states. Second operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:52,937 INFO L93 Difference]: Finished difference Result 14404 states and 22082 transitions. [2022-02-20 18:57:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 22082 transitions. [2022-02-20 18:57:52,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:52,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:52,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 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 14404 states. [2022-02-20 18:57:52,994 INFO L87 Difference]: Start difference. First operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 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 14404 states. [2022-02-20 18:57:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:58,862 INFO L93 Difference]: Finished difference Result 14404 states and 22082 transitions. [2022-02-20 18:57:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 22082 transitions. [2022-02-20 18:57:58,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:58,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:58,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:58,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14402 states, 14401 states have (on average 1.5332962988681342) internal successors, (22081), 14401 states have internal predecessors, (22081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)