./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d295d755d44127829d46828e377e22a38631a635ad7a6b559c09be673317721a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:49:37,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:49:37,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:49:38,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:49:38,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:49:38,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:49:38,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:49:38,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:49:38,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:49:38,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:49:38,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:49:38,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:49:38,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:49:38,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:49:38,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:49:38,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:49:38,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:49:38,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:49:38,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:49:38,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:49:38,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:49:38,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:49:38,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:49:38,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:49:38,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:49:38,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:49:38,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:49:38,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:49:38,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:49:38,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:49:38,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:49:38,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:49:38,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:49:38,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:49:38,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:49:38,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:49:38,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:49:38,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:49:38,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:49:38,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:49:38,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:49:38,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:49:38,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:49:38,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:49:38,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:49:38,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:49:38,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:49:38,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:49:38,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:49:38,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:49:38,073 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:49:38,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:49:38,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:49:38,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:49:38,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:49:38,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:49:38,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:38,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:49:38,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:49:38,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:49:38,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:49:38,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:49:38,078 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:49:38,078 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:49:38,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:49:38,078 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 -> d295d755d44127829d46828e377e22a38631a635ad7a6b559c09be673317721a [2022-02-20 19:49:38,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:49:38,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:49:38,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:49:38,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:49:38,284 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:49:38,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2022-02-20 19:49:38,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4c71ec08/406ea96a4e3d4044ada91794c82a5ac3/FLAG9c6901bf8 [2022-02-20 19:49:38,908 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:49:38,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2022-02-20 19:49:38,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4c71ec08/406ea96a4e3d4044ada91794c82a5ac3/FLAG9c6901bf8 [2022-02-20 19:49:39,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4c71ec08/406ea96a4e3d4044ada91794c82a5ac3 [2022-02-20 19:49:39,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:49:39,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:49:39,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:39,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:49:39,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:49:39,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:39" (1/1) ... [2022-02-20 19:49:39,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bba356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:39, skipping insertion in model container [2022-02-20 19:49:39,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:49:39" (1/1) ... [2022-02-20 19:49:39,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:49:39,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:49:39,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[20426,20439] [2022-02-20 19:49:39,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[22763,22776] [2022-02-20 19:49:40,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:40,016 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:49:40,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[20426,20439] [2022-02-20 19:49:40,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c[22763,22776] [2022-02-20 19:49:40,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:49:40,408 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:49:40,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40 WrapperNode [2022-02-20 19:49:40,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:49:40,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:40,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:49:40,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:49:40,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:40,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:40,801 INFO L137 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5210 [2022-02-20 19:49:40,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:49:40,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:49:40,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:49:40,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:49:40,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:40,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:40,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:40,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:41,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:41,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:41,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:41,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:49:41,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:49:41,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:49:41,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:49:41,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (1/1) ... [2022-02-20 19:49:41,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:49:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:49:41,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:49:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:49:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:49:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:49:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:49:41,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:49:41,397 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:49:41,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:49:47,727 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:49:47,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:49:47,739 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:49:47,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:49:47 BoogieIcfgContainer [2022-02-20 19:49:47,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:49:47,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:49:47,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:49:47,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:49:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:49:39" (1/3) ... [2022-02-20 19:49:47,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc90e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:49:47, skipping insertion in model container [2022-02-20 19:49:47,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:49:40" (2/3) ... [2022-02-20 19:49:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc90e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:49:47, skipping insertion in model container [2022-02-20 19:49:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:49:47" (3/3) ... [2022-02-20 19:49:47,746 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label03.c [2022-02-20 19:49:47,749 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:49:47,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:49:47,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:49:47,791 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:49:47,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:49:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 19:49:47,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:47,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:49:47,834 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1744659899, now seen corresponding path program 1 times [2022-02-20 19:49:47,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:47,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848542867] [2022-02-20 19:49:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:48,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {949#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet58#1);havoc main_#t~nondet58#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet56#1, main2_#t~ret57#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {949#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet56#1 && main2_#t~nondet56#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet56#1;havoc main2_#t~nondet56#1; {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {949#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret53#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {949#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {949#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {949#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {949#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {949#(<= 15 ~a24~0)} is VALID [2022-02-20 19:49:48,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {949#(<= 15 ~a24~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {948#false} is VALID [2022-02-20 19:49:48,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 19:49:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:49:48,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:48,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848542867] [2022-02-20 19:49:48,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848542867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:48,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:48,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:49:48,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506274176] [2022-02-20 19:49:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 19:49:48,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:48,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:48,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:48,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:49:48,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:49:48,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:49:48,085 INFO L87 Difference]: Start difference. First operand has 944 states, 941 states have (on average 1.8979808714133901) internal successors, (1786), 943 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:53,491 INFO L93 Difference]: Finished difference Result 2587 states and 4966 transitions. [2022-02-20 19:49:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:49:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 19:49:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:49:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4966 transitions. [2022-02-20 19:49:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4966 transitions. [2022-02-20 19:49:53,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4966 transitions. [2022-02-20 19:49:57,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4966 edges. 4966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:57,223 INFO L225 Difference]: With dead ends: 2587 [2022-02-20 19:49:57,223 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:49:57,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:49:57,231 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 1032 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:49:57,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 700 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:49:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:49:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:49:57,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:49:57,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,330 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:57,411 INFO L93 Difference]: Finished difference Result 1629 states and 2680 transitions. [2022-02-20 19:49:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2680 transitions. [2022-02-20 19:49:57,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:57,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:57,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 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 1629 states. [2022-02-20 19:49:57,430 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 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 1629 states. [2022-02-20 19:49:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:57,507 INFO L93 Difference]: Finished difference Result 1629 states and 2680 transitions. [2022-02-20 19:49:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2680 transitions. [2022-02-20 19:49:57,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:57,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:57,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:49:57,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:49:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.6472034419176398) internal successors, (2680), 1628 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2680 transitions. [2022-02-20 19:49:57,589 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2680 transitions. Word has length 20 [2022-02-20 19:49:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:49:57,589 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2680 transitions. [2022-02-20 19:49:57,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2680 transitions. [2022-02-20 19:49:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:49:57,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:57,591 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] [2022-02-20 19:49:57,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:49:57,591 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 325703937, now seen corresponding path program 1 times [2022-02-20 19:49:57,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:57,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797606583] [2022-02-20 19:49:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:57,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {8488#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8488#true} is VALID [2022-02-20 19:49:57,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {8488#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {8488#true} is VALID [2022-02-20 19:49:57,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {8488#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8488#true} is VALID [2022-02-20 19:49:57,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {8488#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8490#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:49:57,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {8490#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8491#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:49:57,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {8491#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8492#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:49:57,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {8492#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8489#false} is VALID [2022-02-20 19:49:57,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {8489#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8489#false} is VALID [2022-02-20 19:49:57,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {8489#false} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {8489#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {8489#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:49:57,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {8489#false} ~mode1~0 := 0; {8489#false} is VALID [2022-02-20 19:49:57,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {8489#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {8489#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {8489#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {8489#false} ~mode2~0 := 0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {8489#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {8489#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {8489#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {8489#false} ~mode3~0 := 0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {8489#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {8489#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {8489#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {8489#false} ~mode4~0 := 0; {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {8489#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {8489#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {8489#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {8489#false} ~mode5~0 := 0; {8489#false} is VALID [2022-02-20 19:49:57,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {8489#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#false} assume !(0 != ~mode6~0 % 256); {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {8489#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {8489#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {8489#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {8489#false} assume !(0 != ~mode7~0 % 256); {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {8489#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {8489#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {8489#false} is VALID [2022-02-20 19:49:57,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {8489#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {8489#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {8489#false} check_#res#1 := check_~tmp~1#1; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {8489#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {8489#false} assume 0 == assert_~arg#1 % 256; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {8489#false} assume !false; {8489#false} is VALID [2022-02-20 19:49:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:49:57,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:57,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797606583] [2022-02-20 19:49:57,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797606583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:57,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:57,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:49:57,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254254695] [2022-02-20 19:49:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:57,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:49:57,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:57,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:49:57,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:57,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:49:57,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:49:57,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:49:57,707 INFO L87 Difference]: Start difference. First operand 1629 states and 2680 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:01,506 INFO L93 Difference]: Finished difference Result 1701 states and 2792 transitions. [2022-02-20 19:50:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:50:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:50:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1765 transitions. [2022-02-20 19:50:01,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1765 transitions. [2022-02-20 19:50:02,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1765 edges. 1765 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:02,841 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 19:50:02,842 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 19:50:02,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:50:02,843 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 3 mSDsluCounter, 4900 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6551 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:02,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6551 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 19:50:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2022-02-20 19:50:02,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:02,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:02,880 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:02,882 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:02,958 INFO L93 Difference]: Finished difference Result 1629 states and 2630 transitions. [2022-02-20 19:50:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2630 transitions. [2022-02-20 19:50:02,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:02,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:02,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 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 1629 states. [2022-02-20 19:50:02,966 INFO L87 Difference]: Start difference. First operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 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 1629 states. [2022-02-20 19:50:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:03,043 INFO L93 Difference]: Finished difference Result 1629 states and 2630 transitions. [2022-02-20 19:50:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2630 transitions. [2022-02-20 19:50:03,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:03,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:03,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:03,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1627 states have (on average 1.6164720344191763) internal successors, (2630), 1628 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2630 transitions. [2022-02-20 19:50:03,127 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2630 transitions. Word has length 42 [2022-02-20 19:50:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:03,128 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2630 transitions. [2022-02-20 19:50:03,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2630 transitions. [2022-02-20 19:50:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:03,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:03,131 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] [2022-02-20 19:50:03,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:50:03,131 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1207745120, now seen corresponding path program 1 times [2022-02-20 19:50:03,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:03,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115402650] [2022-02-20 19:50:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:03,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {15140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15140#true} is VALID [2022-02-20 19:50:03,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {15140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {15140#true} is VALID [2022-02-20 19:50:03,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {15140#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15140#true} is VALID [2022-02-20 19:50:03,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {15140#true} assume 0 == ~r1~0; {15140#true} is VALID [2022-02-20 19:50:03,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {15140#true} assume ~id1~0 >= 0; {15140#true} is VALID [2022-02-20 19:50:03,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {15140#true} assume 0 == ~st1~0; {15140#true} is VALID [2022-02-20 19:50:03,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {15140#true} assume ~send1~0 == ~id1~0; {15140#true} is VALID [2022-02-20 19:50:03,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {15140#true} assume 0 == ~mode1~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:50:03,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {15142#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {15141#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {15141#false} ~mode1~0 := 0; {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {15141#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {15141#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {15141#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:03,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {15141#false} ~mode2~0 := 0; {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {15141#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {15141#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {15141#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {15141#false} ~mode3~0 := 0; {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {15141#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {15141#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {15141#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {15141#false} ~mode4~0 := 0; {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {15141#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {15141#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {15141#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 76: Hoare triple {15141#false} ~mode5~0 := 0; {15141#false} is VALID [2022-02-20 19:50:03,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {15141#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 78: Hoare triple {15141#false} assume !(0 != ~mode6~0 % 256); {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 79: Hoare triple {15141#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 80: Hoare triple {15141#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 81: Hoare triple {15141#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {15141#false} assume !(0 != ~mode7~0 % 256); {15141#false} is VALID [2022-02-20 19:50:03,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {15141#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 84: Hoare triple {15141#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 85: Hoare triple {15141#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 86: Hoare triple {15141#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 87: Hoare triple {15141#false} check_#res#1 := check_~tmp~1#1; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 88: Hoare triple {15141#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15141#false} is VALID [2022-02-20 19:50:03,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {15141#false} assume 0 == assert_~arg#1 % 256; {15141#false} is VALID [2022-02-20 19:50:03,311 INFO L290 TraceCheckUtils]: 90: Hoare triple {15141#false} assume !false; {15141#false} is VALID [2022-02-20 19:50:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:03,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:03,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115402650] [2022-02-20 19:50:03,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115402650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:03,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:03,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:03,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391546369] [2022-02-20 19:50:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:03,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:03,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:03,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:03,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:03,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:03,366 INFO L87 Difference]: Start difference. First operand 1629 states and 2630 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:05,064 INFO L93 Difference]: Finished difference Result 1759 states and 2836 transitions. [2022-02-20 19:50:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:05,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:06,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:06,687 INFO L225 Difference]: With dead ends: 1759 [2022-02-20 19:50:06,687 INFO L226 Difference]: Without dead ends: 1691 [2022-02-20 19:50:06,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:06,690 INFO L933 BasicCegarLoop]: 1697 mSDtfsCounter, 1537 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:06,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1803 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-02-20 19:50:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2022-02-20 19:50:06,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:06,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:06,730 INFO L74 IsIncluded]: Start isIncluded. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:06,732 INFO L87 Difference]: Start difference. First operand 1691 states. Second operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:06,811 INFO L93 Difference]: Finished difference Result 1691 states and 2727 transitions. [2022-02-20 19:50:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2727 transitions. [2022-02-20 19:50:06,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:06,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:06,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 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 1691 states. [2022-02-20 19:50:06,820 INFO L87 Difference]: Start difference. First operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 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 1691 states. [2022-02-20 19:50:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:06,899 INFO L93 Difference]: Finished difference Result 1691 states and 2727 transitions. [2022-02-20 19:50:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2727 transitions. [2022-02-20 19:50:06,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:06,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:06,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:06,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.6158861885002964) internal successors, (2726), 1688 states have internal predecessors, (2726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2726 transitions. [2022-02-20 19:50:06,993 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2726 transitions. Word has length 91 [2022-02-20 19:50:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:06,993 INFO L470 AbstractCegarLoop]: Abstraction has 1689 states and 2726 transitions. [2022-02-20 19:50:06,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2726 transitions. [2022-02-20 19:50:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:06,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:06,995 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] [2022-02-20 19:50:06,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:50:06,995 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1564953708, now seen corresponding path program 1 times [2022-02-20 19:50:06,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:06,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145268054] [2022-02-20 19:50:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:07,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {22047#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {22047#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {22047#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {22047#true} assume 0 == ~r1~0; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {22047#true} assume ~id1~0 >= 0; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {22047#true} assume 0 == ~st1~0; {22047#true} is VALID [2022-02-20 19:50:07,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {22047#true} assume ~send1~0 == ~id1~0; {22047#true} is VALID [2022-02-20 19:50:07,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {22047#true} assume 0 == ~mode1~0 % 256; {22047#true} is VALID [2022-02-20 19:50:07,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {22047#true} assume ~id2~0 >= 0; {22047#true} is VALID [2022-02-20 19:50:07,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {22047#true} assume 0 == ~st2~0; {22047#true} is VALID [2022-02-20 19:50:07,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {22047#true} assume ~send2~0 == ~id2~0; {22047#true} is VALID [2022-02-20 19:50:07,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {22047#true} assume 0 == ~mode2~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:50:07,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {22049#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {22048#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:07,115 INFO L290 TraceCheckUtils]: 64: Hoare triple {22048#false} ~mode2~0 := 0; {22048#false} is VALID [2022-02-20 19:50:07,115 INFO L290 TraceCheckUtils]: 65: Hoare triple {22048#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,115 INFO L290 TraceCheckUtils]: 66: Hoare triple {22048#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,115 INFO L290 TraceCheckUtils]: 67: Hoare triple {22048#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 68: Hoare triple {22048#false} ~mode3~0 := 0; {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {22048#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {22048#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {22048#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {22048#false} ~mode4~0 := 0; {22048#false} is VALID [2022-02-20 19:50:07,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {22048#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {22048#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {22048#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22048#false} is VALID [2022-02-20 19:50:07,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {22048#false} ~mode5~0 := 0; {22048#false} is VALID [2022-02-20 19:50:07,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {22048#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {22048#false} assume !(0 != ~mode6~0 % 256); {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {22048#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {22048#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {22048#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {22048#false} assume !(0 != ~mode7~0 % 256); {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {22048#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {22048#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {22048#false} is VALID [2022-02-20 19:50:07,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {22048#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22048#false} is VALID [2022-02-20 19:50:07,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {22048#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {22048#false} is VALID [2022-02-20 19:50:07,119 INFO L290 TraceCheckUtils]: 87: Hoare triple {22048#false} check_#res#1 := check_~tmp~1#1; {22048#false} is VALID [2022-02-20 19:50:07,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {22048#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22048#false} is VALID [2022-02-20 19:50:07,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {22048#false} assume 0 == assert_~arg#1 % 256; {22048#false} is VALID [2022-02-20 19:50:07,119 INFO L290 TraceCheckUtils]: 90: Hoare triple {22048#false} assume !false; {22048#false} is VALID [2022-02-20 19:50:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:07,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:07,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145268054] [2022-02-20 19:50:07,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145268054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:07,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:07,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:07,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842307704] [2022-02-20 19:50:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:07,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:07,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:07,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:07,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:07,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:07,179 INFO L87 Difference]: Start difference. First operand 1689 states and 2726 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:08,877 INFO L93 Difference]: Finished difference Result 1933 states and 3114 transitions. [2022-02-20 19:50:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:08,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:10,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:10,412 INFO L225 Difference]: With dead ends: 1933 [2022-02-20 19:50:10,413 INFO L226 Difference]: Without dead ends: 1805 [2022-02-20 19:50:10,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:10,414 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 1533 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:10,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1802 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-02-20 19:50:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1803. [2022-02-20 19:50:10,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:10,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,456 INFO L74 IsIncluded]: Start isIncluded. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,457 INFO L87 Difference]: Start difference. First operand 1805 states. Second operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:10,543 INFO L93 Difference]: Finished difference Result 1805 states and 2908 transitions. [2022-02-20 19:50:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2908 transitions. [2022-02-20 19:50:10,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:10,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:10,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 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 1805 states. [2022-02-20 19:50:10,549 INFO L87 Difference]: Start difference. First operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 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 1805 states. [2022-02-20 19:50:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:10,634 INFO L93 Difference]: Finished difference Result 1805 states and 2908 transitions. [2022-02-20 19:50:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2908 transitions. [2022-02-20 19:50:10,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:10,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:10,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:10,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1801 states have (on average 1.6141032759578011) internal successors, (2907), 1802 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2907 transitions. [2022-02-20 19:50:10,727 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2907 transitions. Word has length 91 [2022-02-20 19:50:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:10,727 INFO L470 AbstractCegarLoop]: Abstraction has 1803 states and 2907 transitions. [2022-02-20 19:50:10,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2907 transitions. [2022-02-20 19:50:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:10,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:10,728 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] [2022-02-20 19:50:10,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:50:10,729 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1479108296, now seen corresponding path program 1 times [2022-02-20 19:50:10,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:10,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629052265] [2022-02-20 19:50:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:10,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {29520#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29520#true} is VALID [2022-02-20 19:50:10,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {29520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {29520#true} is VALID [2022-02-20 19:50:10,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {29520#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29520#true} is VALID [2022-02-20 19:50:10,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {29520#true} assume 0 == ~r1~0; {29520#true} is VALID [2022-02-20 19:50:10,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {29520#true} assume ~id1~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:10,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {29520#true} assume 0 == ~st1~0; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {29520#true} assume ~send1~0 == ~id1~0; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {29520#true} assume 0 == ~mode1~0 % 256; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {29520#true} assume ~id2~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {29520#true} assume 0 == ~st2~0; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {29520#true} assume ~send2~0 == ~id2~0; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {29520#true} assume 0 == ~mode2~0 % 256; {29520#true} is VALID [2022-02-20 19:50:10,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {29520#true} assume ~id3~0 >= 0; {29520#true} is VALID [2022-02-20 19:50:10,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {29520#true} assume 0 == ~st3~0; {29520#true} is VALID [2022-02-20 19:50:10,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {29520#true} assume ~send3~0 == ~id3~0; {29520#true} is VALID [2022-02-20 19:50:10,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {29520#true} assume 0 == ~mode3~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,843 INFO L290 TraceCheckUtils]: 50: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:50:10,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {29522#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {29521#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:10,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {29521#false} ~mode3~0 := 0; {29521#false} is VALID [2022-02-20 19:50:10,849 INFO L290 TraceCheckUtils]: 69: Hoare triple {29521#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 70: Hoare triple {29521#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {29521#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {29521#false} ~mode4~0 := 0; {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 73: Hoare triple {29521#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 74: Hoare triple {29521#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {29521#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29521#false} is VALID [2022-02-20 19:50:10,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {29521#false} ~mode5~0 := 0; {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {29521#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 78: Hoare triple {29521#false} assume !(0 != ~mode6~0 % 256); {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 79: Hoare triple {29521#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 80: Hoare triple {29521#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 81: Hoare triple {29521#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 82: Hoare triple {29521#false} assume !(0 != ~mode7~0 % 256); {29521#false} is VALID [2022-02-20 19:50:10,851 INFO L290 TraceCheckUtils]: 83: Hoare triple {29521#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {29521#false} is VALID [2022-02-20 19:50:10,859 INFO L290 TraceCheckUtils]: 84: Hoare triple {29521#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {29521#false} is VALID [2022-02-20 19:50:10,859 INFO L290 TraceCheckUtils]: 85: Hoare triple {29521#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29521#false} is VALID [2022-02-20 19:50:10,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {29521#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29521#false} is VALID [2022-02-20 19:50:10,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {29521#false} check_#res#1 := check_~tmp~1#1; {29521#false} is VALID [2022-02-20 19:50:10,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {29521#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29521#false} is VALID [2022-02-20 19:50:10,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {29521#false} assume 0 == assert_~arg#1 % 256; {29521#false} is VALID [2022-02-20 19:50:10,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {29521#false} assume !false; {29521#false} is VALID [2022-02-20 19:50:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:10,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:10,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629052265] [2022-02-20 19:50:10,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629052265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:10,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:10,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:10,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920858706] [2022-02-20 19:50:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:10,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:10,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:10,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:10,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:10,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:10,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:10,916 INFO L87 Difference]: Start difference. First operand 1803 states and 2907 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:12,670 INFO L93 Difference]: Finished difference Result 2263 states and 3637 transitions. [2022-02-20 19:50:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:12,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:14,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:14,217 INFO L225 Difference]: With dead ends: 2263 [2022-02-20 19:50:14,217 INFO L226 Difference]: Without dead ends: 2021 [2022-02-20 19:50:14,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:14,219 INFO L933 BasicCegarLoop]: 1687 mSDtfsCounter, 1529 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:14,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1801 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-02-20 19:50:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2019. [2022-02-20 19:50:14,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:14,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,278 INFO L74 IsIncluded]: Start isIncluded. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,279 INFO L87 Difference]: Start difference. First operand 2021 states. Second operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:14,380 INFO L93 Difference]: Finished difference Result 2021 states and 3248 transitions. [2022-02-20 19:50:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3248 transitions. [2022-02-20 19:50:14,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:14,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:14,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 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 2021 states. [2022-02-20 19:50:14,386 INFO L87 Difference]: Start difference. First operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 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 2021 states. [2022-02-20 19:50:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:14,494 INFO L93 Difference]: Finished difference Result 2021 states and 3248 transitions. [2022-02-20 19:50:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3248 transitions. [2022-02-20 19:50:14,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:14,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:14,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:14,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2017 states have (on average 1.6098165592464055) internal successors, (3247), 2018 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3247 transitions. [2022-02-20 19:50:14,614 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3247 transitions. Word has length 91 [2022-02-20 19:50:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:14,614 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 3247 transitions. [2022-02-20 19:50:14,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3247 transitions. [2022-02-20 19:50:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:14,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:14,616 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] [2022-02-20 19:50:14,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:50:14,617 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 733525566, now seen corresponding path program 1 times [2022-02-20 19:50:14,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:14,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867851602] [2022-02-20 19:50:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:14,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {38071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {38071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {38071#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {38071#true} assume 0 == ~r1~0; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {38071#true} assume ~id1~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {38071#true} assume 0 == ~st1~0; {38071#true} is VALID [2022-02-20 19:50:14,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {38071#true} assume ~send1~0 == ~id1~0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {38071#true} assume 0 == ~mode1~0 % 256; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {38071#true} assume ~id2~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {38071#true} assume 0 == ~st2~0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {38071#true} assume ~send2~0 == ~id2~0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {38071#true} assume 0 == ~mode2~0 % 256; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {38071#true} assume ~id3~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {38071#true} assume 0 == ~st3~0; {38071#true} is VALID [2022-02-20 19:50:14,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {38071#true} assume ~send3~0 == ~id3~0; {38071#true} is VALID [2022-02-20 19:50:14,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {38071#true} assume 0 == ~mode3~0 % 256; {38071#true} is VALID [2022-02-20 19:50:14,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {38071#true} assume ~id4~0 >= 0; {38071#true} is VALID [2022-02-20 19:50:14,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {38071#true} assume 0 == ~st4~0; {38071#true} is VALID [2022-02-20 19:50:14,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {38071#true} assume ~send4~0 == ~id4~0; {38071#true} is VALID [2022-02-20 19:50:14,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {38071#true} assume 0 == ~mode4~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,729 INFO L290 TraceCheckUtils]: 67: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {38073#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {38072#false} assume !(node4_~m4~0#1 != ~nomsg~0); {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {38072#false} ~mode4~0 := 0; {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {38072#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {38072#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {38072#false} assume !(node5_~m5~0#1 != ~nomsg~0); {38072#false} is VALID [2022-02-20 19:50:14,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {38072#false} ~mode5~0 := 0; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {38072#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {38072#false} assume !(0 != ~mode6~0 % 256); {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 79: Hoare triple {38072#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {38072#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {38072#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {38072#false} assume !(0 != ~mode7~0 % 256); {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {38072#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {38072#false} is VALID [2022-02-20 19:50:14,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {38072#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 85: Hoare triple {38072#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 86: Hoare triple {38072#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 87: Hoare triple {38072#false} check_#res#1 := check_~tmp~1#1; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {38072#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {38072#false} assume 0 == assert_~arg#1 % 256; {38072#false} is VALID [2022-02-20 19:50:14,733 INFO L290 TraceCheckUtils]: 90: Hoare triple {38072#false} assume !false; {38072#false} is VALID [2022-02-20 19:50:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:14,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:14,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867851602] [2022-02-20 19:50:14,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867851602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:14,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:14,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:14,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833653892] [2022-02-20 19:50:14,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:14,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:14,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:14,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:14,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:14,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:14,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:14,797 INFO L87 Difference]: Start difference. First operand 2019 states and 3247 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:16,702 INFO L93 Difference]: Finished difference Result 2887 states and 4617 transitions. [2022-02-20 19:50:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:16,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:16,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:18,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:18,296 INFO L225 Difference]: With dead ends: 2887 [2022-02-20 19:50:18,296 INFO L226 Difference]: Without dead ends: 2429 [2022-02-20 19:50:18,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:18,297 INFO L933 BasicCegarLoop]: 1682 mSDtfsCounter, 1525 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:18,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 1800 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2022-02-20 19:50:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2427. [2022-02-20 19:50:18,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:18,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,394 INFO L74 IsIncluded]: Start isIncluded. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,395 INFO L87 Difference]: Start difference. First operand 2429 states. Second operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:18,546 INFO L93 Difference]: Finished difference Result 2429 states and 3884 transitions. [2022-02-20 19:50:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3884 transitions. [2022-02-20 19:50:18,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:18,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:18,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2429 states. [2022-02-20 19:50:18,553 INFO L87 Difference]: Start difference. First operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2429 states. [2022-02-20 19:50:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:18,707 INFO L93 Difference]: Finished difference Result 2429 states and 3884 transitions. [2022-02-20 19:50:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3884 transitions. [2022-02-20 19:50:18,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:18,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:18,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:18,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2425 states have (on average 1.6012371134020618) internal successors, (3883), 2426 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3883 transitions. [2022-02-20 19:50:18,873 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3883 transitions. Word has length 91 [2022-02-20 19:50:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:18,873 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 3883 transitions. [2022-02-20 19:50:18,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3883 transitions. [2022-02-20 19:50:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:18,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:18,874 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] [2022-02-20 19:50:18,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:50:18,874 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1206505292, now seen corresponding path program 1 times [2022-02-20 19:50:18,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:18,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080721527] [2022-02-20 19:50:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {48670#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {48670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {48670#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {48670#true} assume 0 == ~r1~0; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {48670#true} assume ~id1~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {48670#true} assume 0 == ~st1~0; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {48670#true} assume ~send1~0 == ~id1~0; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {48670#true} assume 0 == ~mode1~0 % 256; {48670#true} is VALID [2022-02-20 19:50:18,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {48670#true} assume ~id2~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {48670#true} assume 0 == ~st2~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {48670#true} assume ~send2~0 == ~id2~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {48670#true} assume 0 == ~mode2~0 % 256; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {48670#true} assume ~id3~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {48670#true} assume 0 == ~st3~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {48670#true} assume ~send3~0 == ~id3~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {48670#true} assume 0 == ~mode3~0 % 256; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {48670#true} assume ~id4~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {48670#true} assume 0 == ~st4~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {48670#true} assume ~send4~0 == ~id4~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {48670#true} assume 0 == ~mode4~0 % 256; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {48670#true} assume ~id5~0 >= 0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {48670#true} assume 0 == ~st5~0; {48670#true} is VALID [2022-02-20 19:50:18,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {48670#true} assume ~send5~0 == ~id5~0; {48670#true} is VALID [2022-02-20 19:50:18,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {48670#true} assume 0 == ~mode5~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:50:18,997 INFO L290 TraceCheckUtils]: 74: Hoare triple {48672#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {48671#false} is VALID [2022-02-20 19:50:18,997 INFO L290 TraceCheckUtils]: 75: Hoare triple {48671#false} assume !(node5_~m5~0#1 != ~nomsg~0); {48671#false} is VALID [2022-02-20 19:50:18,997 INFO L290 TraceCheckUtils]: 76: Hoare triple {48671#false} ~mode5~0 := 0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 77: Hoare triple {48671#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 78: Hoare triple {48671#false} assume !(0 != ~mode6~0 % 256); {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 79: Hoare triple {48671#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {48671#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 81: Hoare triple {48671#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 82: Hoare triple {48671#false} assume !(0 != ~mode7~0 % 256); {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 83: Hoare triple {48671#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 84: Hoare triple {48671#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 85: Hoare triple {48671#false} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 86: Hoare triple {48671#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 87: Hoare triple {48671#false} check_#res#1 := check_~tmp~1#1; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 88: Hoare triple {48671#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {48671#false} assume 0 == assert_~arg#1 % 256; {48671#false} is VALID [2022-02-20 19:50:18,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {48671#false} assume !false; {48671#false} is VALID [2022-02-20 19:50:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:18,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:18,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080721527] [2022-02-20 19:50:18,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080721527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:18,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:18,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:50:18,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842071266] [2022-02-20 19:50:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:19,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:19,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:19,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:19,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:19,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:19,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:19,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:19,053 INFO L87 Difference]: Start difference. First operand 2427 states and 3883 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:21,353 INFO L93 Difference]: Finished difference Result 4063 states and 6445 transitions. [2022-02-20 19:50:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:21,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2022-02-20 19:50:21,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1809 transitions. [2022-02-20 19:50:22,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1809 edges. 1809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:23,143 INFO L225 Difference]: With dead ends: 4063 [2022-02-20 19:50:23,143 INFO L226 Difference]: Without dead ends: 3197 [2022-02-20 19:50:23,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:23,145 INFO L933 BasicCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:23,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 1799 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:50:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2022-02-20 19:50:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3195. [2022-02-20 19:50:23,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:23,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:23,326 INFO L74 IsIncluded]: Start isIncluded. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:23,328 INFO L87 Difference]: Start difference. First operand 3197 states. Second operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:23,613 INFO L93 Difference]: Finished difference Result 3197 states and 5068 transitions. [2022-02-20 19:50:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5068 transitions. [2022-02-20 19:50:23,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:23,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:23,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 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 3197 states. [2022-02-20 19:50:23,623 INFO L87 Difference]: Start difference. First operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 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 3197 states. [2022-02-20 19:50:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:23,909 INFO L93 Difference]: Finished difference Result 3197 states and 5068 transitions. [2022-02-20 19:50:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 5068 transitions. [2022-02-20 19:50:23,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:23,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:23,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:23,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3195 states, 3193 states have (on average 1.5869088631381145) internal successors, (5067), 3194 states have internal predecessors, (5067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5067 transitions. [2022-02-20 19:50:24,254 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5067 transitions. Word has length 91 [2022-02-20 19:50:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:24,254 INFO L470 AbstractCegarLoop]: Abstraction has 3195 states and 5067 transitions. [2022-02-20 19:50:24,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5067 transitions. [2022-02-20 19:50:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:50:24,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:24,255 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] [2022-02-20 19:50:24,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:50:24,255 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:24,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1494177322, now seen corresponding path program 1 times [2022-02-20 19:50:24,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:24,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079556910] [2022-02-20 19:50:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:24,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {63149#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {63149#true} is VALID [2022-02-20 19:50:24,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {63149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet58#1, main_#t~ret59#1, main_#t~ret60#1;assume -2147483648 <= main_#t~nondet58#1 && main_#t~nondet58#1 <= 2147483647; {63149#true} is VALID [2022-02-20 19:50:24,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {63149#true} assume 0 != main_#t~nondet58#1;havoc main_#t~nondet58#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_#t~post43#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63149#true} is VALID [2022-02-20 19:50:24,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {63149#true} assume 0 == ~r1~0; {63149#true} is VALID [2022-02-20 19:50:24,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {63149#true} assume ~id1~0 >= 0; {63149#true} is VALID [2022-02-20 19:50:24,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {63149#true} assume 0 == ~st1~0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:24,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {63151#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:24,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {63151#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:24,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {63151#(<= ~st1~0 0)} assume ~id2~0 >= 0; {63151#(<= ~st1~0 0)} is VALID [2022-02-20 19:50:24,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {63151#(<= ~st1~0 0)} assume 0 == ~st2~0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {63152#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {63152#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {63153#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {63154#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:50:24,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {63155#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {63156#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite5#1 := ~p1_new~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,403 INFO L290 TraceCheckUtils]: 60: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite6#1 := ~p2_new~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,404 INFO L290 TraceCheckUtils]: 64: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,406 INFO L290 TraceCheckUtils]: 70: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:50:24,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {63157#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {63150#false} is VALID [2022-02-20 19:50:24,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {63150#false} check_#res#1 := check_~tmp~1#1; {63150#false} is VALID [2022-02-20 19:50:24,413 INFO L290 TraceCheckUtils]: 88: Hoare triple {63150#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {63150#false} is VALID [2022-02-20 19:50:24,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {63150#false} assume 0 == assert_~arg#1 % 256; {63150#false} is VALID [2022-02-20 19:50:24,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {63150#false} assume !false; {63150#false} is VALID [2022-02-20 19:50:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:50:24,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:24,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079556910] [2022-02-20 19:50:24,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079556910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:24,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:24,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:50:24,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932350634] [2022-02-20 19:50:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 19:50:24,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:24,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:24,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:24,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:50:24,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:50:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:50:24,477 INFO L87 Difference]: Start difference. First operand 3195 states and 5067 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)