./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.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 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:37,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:37,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:37,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:37,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:37,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:37,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:37,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:37,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:37,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:37,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:37,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:37,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:37,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:37,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:37,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:37,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:37,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:37,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:37,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:37,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:37,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:37,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:37,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:37,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:37,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:37,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:37,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:37,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:37,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:37,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:37,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:37,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:37,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:37,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:37,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:37,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:37,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:37,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:37,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:37,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:37,986 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:53:38,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:38,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:38,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:38,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:38,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:38,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:38,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:38,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:38,011 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:38,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:38,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:38,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:38,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:38,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:38,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:38,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:38,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:38,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:38,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:38,015 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:38,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:38,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:38,016 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 -> 4b8e4f57289bafd3f29582b11c1ea3d32af0aa4d03b738aef04f29eb11d15fcf [2022-02-20 19:53:38,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:38,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:38,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:38,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:38,222 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:38,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:53:38,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62bbaa20c/fb35d06cde804a988a0d7362a83b318f/FLAG62d10fa30 [2022-02-20 19:53:38,784 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:38,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:53:38,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62bbaa20c/fb35d06cde804a988a0d7362a83b318f/FLAG62d10fa30 [2022-02-20 19:53:39,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62bbaa20c/fb35d06cde804a988a0d7362a83b318f [2022-02-20 19:53:39,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:39,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:39,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:39,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:39,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:39,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:39" (1/1) ... [2022-02-20 19:53:39,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b519cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:39, skipping insertion in model container [2022-02-20 19:53:39,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:39" (1/1) ... [2022-02-20 19:53:39,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:39,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:39,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2022-02-20 19:53:39,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2022-02-20 19:53:40,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:40,147 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:40,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[26888,26901] [2022-02-20 19:53:40,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c[34636,34649] [2022-02-20 19:53:40,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:40,512 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:40,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40 WrapperNode [2022-02-20 19:53:40,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:40,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:40,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:40,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:40,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:40,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:40,827 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:40,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:40,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:40,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:40,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:40,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:40,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:40,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:40,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:41,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:41,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53: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:53:40" (1/1) ... [2022-02-20 19:53:41,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:41,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:41,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:41,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:41,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (1/1) ... [2022-02-20 19:53:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:41,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:53:41,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:53:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:41,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:41,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:41,438 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:41,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:48,096 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:48,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:48,106 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:48,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:48 BoogieIcfgContainer [2022-02-20 19:53:48,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:48,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:48,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:48,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:39" (1/3) ... [2022-02-20 19:53:48,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef4fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:48, skipping insertion in model container [2022-02-20 19:53:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:40" (2/3) ... [2022-02-20 19:53:48,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef4fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:48, skipping insertion in model container [2022-02-20 19:53:48,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:48" (3/3) ... [2022-02-20 19:53:48,114 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:53:48,117 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:48,117 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:48,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:48,152 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:53:48,153 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:48,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:48,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:48,190 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -805214309, now seen corresponding path program 1 times [2022-02-20 19:53:48,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:48,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410093933] [2022-02-20 19:53:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:48,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {968#true} is VALID [2022-02-20 19:53:48,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {968#true} is VALID [2022-02-20 19:53:48,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:48,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {968#true} is VALID [2022-02-20 19:53:48,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} init_#res#1 := init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:48,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {968#true} is VALID [2022-02-20 19:53:48,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {969#false} is VALID [2022-02-20 19:53:48,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {969#false} is VALID [2022-02-20 19:53:48,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#false} assume !(0 != ~mode1~0 % 256); {969#false} is VALID [2022-02-20 19:53:48,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {969#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {969#false} is VALID [2022-02-20 19:53:48,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {969#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {969#false} is VALID [2022-02-20 19:53:48,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {969#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {969#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#false} assume !(node2_~m2~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#false} ~mode2~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#false} assume !(node3_~m3~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#false} ~mode3~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {969#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {969#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {969#false} assume !(node4_~m4~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#false} ~mode4~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {969#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {969#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {969#false} assume !(node5_~m5~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {969#false} ~mode5~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {969#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {969#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {969#false} assume !(node6_~m6~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {969#false} ~mode6~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {969#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {969#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {969#false} assume !(node7_~m7~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {969#false} ~mode7~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {969#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:48,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} assume !(node8_~m8~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:48,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {969#false} ~mode8~0 := 0; {969#false} is VALID [2022-02-20 19:53:48,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:48,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {969#false} is VALID [2022-02-20 19:53:48,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} check_#res#1 := check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:48,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {969#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {969#false} is VALID [2022-02-20 19:53:48,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {969#false} assume 0 == assert_~arg#1 % 256; {969#false} is VALID [2022-02-20 19:53:48,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:48,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:48,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410093933] [2022-02-20 19:53:48,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410093933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:48,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:48,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:48,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804409752] [2022-02-20 19:53:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:53:48,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:48,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:48,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:48,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:53:48,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:48,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:53:48,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:48,515 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:49,919 INFO L93 Difference]: Finished difference Result 1861 states and 3516 transitions. [2022-02-20 19:53:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:53:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:53:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:49,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3516 transitions. [2022-02-20 19:53:52,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3516 edges. 3516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:52,475 INFO L225 Difference]: With dead ends: 1861 [2022-02-20 19:53:52,475 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:52,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:52,485 INFO L933 BasicCegarLoop]: 1755 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:52,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:52,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:52,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,538 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,540 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:52,573 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:52,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:52,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:52,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 899 states. [2022-02-20 19:53:52,579 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 899 states. [2022-02-20 19:53:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:52,609 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:52,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:52,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:52,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:52,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1691 transitions. [2022-02-20 19:53:52,643 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1691 transitions. Word has length 46 [2022-02-20 19:53:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:52,643 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1691 transitions. [2022-02-20 19:53:52,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:52,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:52,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:52,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:52,645 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:52,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:52,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287983153] [2022-02-20 19:53:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:52,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5583#true} is VALID [2022-02-20 19:53:52,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {5583#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {5583#true} is VALID [2022-02-20 19:53:52,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {5583#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5583#true} is VALID [2022-02-20 19:53:52,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {5583#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:52,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5586#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:52,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {5586#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:52,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5584#false} is VALID [2022-02-20 19:53:52,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5584#false} is VALID [2022-02-20 19:53:52,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#false} assume !(0 != ~mode1~0 % 256); {5584#false} is VALID [2022-02-20 19:53:52,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {5584#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5584#false} is VALID [2022-02-20 19:53:52,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5584#false} is VALID [2022-02-20 19:53:52,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#false} ~mode2~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#false} ~mode3~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {5584#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {5584#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {5584#false} ~mode4~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {5584#false} ~mode5~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {5584#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {5584#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {5584#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {5584#false} ~mode6~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {5584#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {5584#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {5584#false} assume !(node7_~m7~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {5584#false} ~mode7~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {5584#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {5584#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:52,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {5584#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:52,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {5584#false} ~mode8~0 := 0; {5584#false} is VALID [2022-02-20 19:53:52,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {5584#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:52,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {5584#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5584#false} is VALID [2022-02-20 19:53:52,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {5584#false} check_#res#1 := check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:52,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {5584#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5584#false} is VALID [2022-02-20 19:53:52,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {5584#false} assume 0 == assert_~arg#1 % 256; {5584#false} is VALID [2022-02-20 19:53:52,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {5584#false} assume !false; {5584#false} is VALID [2022-02-20 19:53:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:52,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:52,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287983153] [2022-02-20 19:53:52,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287983153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:52,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:52,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:52,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066233361] [2022-02-20 19:53:52,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:53:52,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:52,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:52,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:52,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:52,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:52,765 INFO L87 Difference]: Start difference. First operand 899 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:56,872 INFO L93 Difference]: Finished difference Result 981 states and 1819 transitions. [2022-02-20 19:53:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:56,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-02-20 19:53:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:56,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:58,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:58,321 INFO L225 Difference]: With dead ends: 981 [2022-02-20 19:53:58,321 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:58,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:53:58,323 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:58,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:58,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:58,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,340 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,342 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:58,369 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:58,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:58,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:58,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 899 states. [2022-02-20 19:53:58,374 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 899 states. [2022-02-20 19:53:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:58,402 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:58,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:58,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:58,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:58,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1630 transitions. [2022-02-20 19:53:58,433 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1630 transitions. Word has length 46 [2022-02-20 19:53:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:58,433 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1630 transitions. [2022-02-20 19:53:58,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:53:58,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:58,436 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] [2022-02-20 19:53:58,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:58,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1295391643, now seen corresponding path program 1 times [2022-02-20 19:53:58,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:58,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710411061] [2022-02-20 19:53:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:58,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {9318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:53:58,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {9320#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,701 INFO L290 TraceCheckUtils]: 62: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9321#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:53:58,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {9321#(not (= (+ (- 3) ~a5~0) 0))} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9319#false} is VALID [2022-02-20 19:53:58,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {9319#false} assume !false; {9319#false} is VALID [2022-02-20 19:53:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:58,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:58,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710411061] [2022-02-20 19:53:58,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710411061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:58,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:58,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:58,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411750729] [2022-02-20 19:53:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:58,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 19:53:58,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:58,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:53:58,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:58,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:53:58,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:53:58,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:53:58,768 INFO L87 Difference]: Start difference. First operand 899 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:10,528 INFO L93 Difference]: Finished difference Result 3154 states and 5939 transitions. [2022-02-20 19:54:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:54:10,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 19:54:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5939 transitions. [2022-02-20 19:54:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5939 transitions. [2022-02-20 19:54:10,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5939 transitions. [2022-02-20 19:54:14,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5939 edges. 5939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:14,689 INFO L225 Difference]: With dead ends: 3154 [2022-02-20 19:54:14,689 INFO L226 Difference]: Without dead ends: 2401 [2022-02-20 19:54:14,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:14,691 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 2553 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:14,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2553 Valid, 884 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-20 19:54:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-02-20 19:54:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2401. [2022-02-20 19:54:14,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:14,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:14,747 INFO L74 IsIncluded]: Start isIncluded. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:14,751 INFO L87 Difference]: Start difference. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:14,918 INFO L93 Difference]: Finished difference Result 2401 states and 3744 transitions. [2022-02-20 19:54:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3744 transitions. [2022-02-20 19:54:14,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:14,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:14,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 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 2401 states. [2022-02-20 19:54:14,942 INFO L87 Difference]: Start difference. First operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 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 2401 states. [2022-02-20 19:54:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:15,104 INFO L93 Difference]: Finished difference Result 2401 states and 3744 transitions. [2022-02-20 19:54:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3744 transitions. [2022-02-20 19:54:15,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:15,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:15,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:15,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 2399 states have (on average 1.5606502709462275) internal successors, (3744), 2400 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3744 transitions. [2022-02-20 19:54:15,290 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3744 transitions. Word has length 67 [2022-02-20 19:54:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:15,291 INFO L470 AbstractCegarLoop]: Abstraction has 2401 states and 3744 transitions. [2022-02-20 19:54:15,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3744 transitions. [2022-02-20 19:54:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:15,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:15,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:15,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:15,293 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash 211182729, now seen corresponding path program 1 times [2022-02-20 19:54:15,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:15,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694657588] [2022-02-20 19:54:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:15,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {19742#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {19742#true} is VALID [2022-02-20 19:54:15,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {19742#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {19742#true} is VALID [2022-02-20 19:54:15,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {19742#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19742#true} is VALID [2022-02-20 19:54:15,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {19742#true} assume 0 == ~r1~0 % 256; {19742#true} is VALID [2022-02-20 19:54:15,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {19742#true} assume ~id1~0 >= 0; {19742#true} is VALID [2022-02-20 19:54:15,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {19742#true} assume 0 == ~st1~0; {19742#true} is VALID [2022-02-20 19:54:15,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {19742#true} assume ~send1~0 == ~id1~0; {19742#true} is VALID [2022-02-20 19:54:15,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {19742#true} assume 0 == ~mode1~0 % 256; {19742#true} is VALID [2022-02-20 19:54:15,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {19742#true} assume ~id2~0 >= 0; {19742#true} is VALID [2022-02-20 19:54:15,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {19742#true} assume 0 == ~st2~0; {19742#true} is VALID [2022-02-20 19:54:15,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {19742#true} assume ~send2~0 == ~id2~0; {19742#true} is VALID [2022-02-20 19:54:15,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {19742#true} assume 0 == ~mode2~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,397 INFO L290 TraceCheckUtils]: 58: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {19744#(= (+ (* (- 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; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {19744#(= (+ (* (- 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; {19744#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:15,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {19744#(= (+ (* (- 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; {19743#false} is VALID [2022-02-20 19:54:15,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {19743#false} assume !(node2_~m2~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,405 INFO L290 TraceCheckUtils]: 75: Hoare triple {19743#false} ~mode2~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,406 INFO L290 TraceCheckUtils]: 76: Hoare triple {19743#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; {19743#false} is VALID [2022-02-20 19:54:15,406 INFO L290 TraceCheckUtils]: 77: Hoare triple {19743#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,406 INFO L290 TraceCheckUtils]: 78: Hoare triple {19743#false} assume !(node3_~m3~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {19743#false} ~mode3~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {19743#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; {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 81: Hoare triple {19743#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 82: Hoare triple {19743#false} assume !(node4_~m4~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {19743#false} ~mode4~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 84: Hoare triple {19743#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; {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {19743#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {19743#false} assume !(node5_~m5~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {19743#false} ~mode5~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,408 INFO L290 TraceCheckUtils]: 88: Hoare triple {19743#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; {19743#false} is VALID [2022-02-20 19:54:15,408 INFO L290 TraceCheckUtils]: 89: Hoare triple {19743#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {19743#false} assume !(node6_~m6~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,408 INFO L290 TraceCheckUtils]: 91: Hoare triple {19743#false} ~mode6~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {19743#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; {19743#false} is VALID [2022-02-20 19:54:15,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {19743#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,409 INFO L290 TraceCheckUtils]: 94: Hoare triple {19743#false} assume !(node7_~m7~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,409 INFO L290 TraceCheckUtils]: 95: Hoare triple {19743#false} ~mode7~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,409 INFO L290 TraceCheckUtils]: 96: Hoare triple {19743#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {19743#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {19743#false} assume !(node8_~m8~0#1 != ~nomsg~0); {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {19743#false} ~mode8~0 := 0; {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {19743#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {19743#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {19743#false} is VALID [2022-02-20 19:54:15,410 INFO L290 TraceCheckUtils]: 102: Hoare triple {19743#false} check_#res#1 := check_~tmp~1#1; {19743#false} is VALID [2022-02-20 19:54:15,411 INFO L290 TraceCheckUtils]: 103: Hoare triple {19743#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {19743#false} is VALID [2022-02-20 19:54:15,411 INFO L290 TraceCheckUtils]: 104: Hoare triple {19743#false} assume 0 == assert_~arg#1 % 256; {19743#false} is VALID [2022-02-20 19:54:15,411 INFO L290 TraceCheckUtils]: 105: Hoare triple {19743#false} assume !false; {19743#false} is VALID [2022-02-20 19:54:15,411 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:54:15,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:15,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694657588] [2022-02-20 19:54:15,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694657588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:15,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:15,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:15,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761777839] [2022-02-20 19:54:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:15,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:15,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:15,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:15,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:15,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:15,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:15,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:15,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:15,489 INFO L87 Difference]: Start difference. First operand 2401 states and 3744 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:17,666 INFO L93 Difference]: Finished difference Result 2551 states and 3982 transitions. [2022-02-20 19:54:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:17,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:17,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:18,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:19,036 INFO L225 Difference]: With dead ends: 2551 [2022-02-20 19:54:19,036 INFO L226 Difference]: Without dead ends: 2473 [2022-02-20 19:54:19,037 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:54:19,038 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1549 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:19,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 1850 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-02-20 19:54:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2471. [2022-02-20 19:54:19,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:19,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,097 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,099 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:19,268 INFO L93 Difference]: Finished difference Result 2473 states and 3857 transitions. [2022-02-20 19:54:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3857 transitions. [2022-02-20 19:54:19,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:19,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:19,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:54:19,277 INFO L87 Difference]: Start difference. First operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 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 2473 states. [2022-02-20 19:54:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:19,446 INFO L93 Difference]: Finished difference Result 2473 states and 3857 transitions. [2022-02-20 19:54:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3857 transitions. [2022-02-20 19:54:19,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:19,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:19,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:19,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2469 states have (on average 1.5617658971243418) internal successors, (3856), 2470 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3856 transitions. [2022-02-20 19:54:19,631 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3856 transitions. Word has length 106 [2022-02-20 19:54:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:19,631 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3856 transitions. [2022-02-20 19:54:19,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3856 transitions. [2022-02-20 19:54:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:19,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:19,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:19,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:19,633 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1458691583, now seen corresponding path program 1 times [2022-02-20 19:54:19,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:19,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522898037] [2022-02-20 19:54:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:19,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {29802#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29802#true} is VALID [2022-02-20 19:54:19,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {29802#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {29802#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {29802#true} assume 0 == ~r1~0 % 256; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {29802#true} assume ~id1~0 >= 0; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {29802#true} assume 0 == ~st1~0; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {29802#true} assume ~send1~0 == ~id1~0; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {29802#true} assume 0 == ~mode1~0 % 256; {29802#true} is VALID [2022-02-20 19:54:19,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {29802#true} assume ~id2~0 >= 0; {29802#true} is VALID [2022-02-20 19:54:19,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {29802#true} assume 0 == ~st2~0; {29802#true} is VALID [2022-02-20 19:54:19,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {29802#true} assume ~send2~0 == ~id2~0; {29802#true} is VALID [2022-02-20 19:54:19,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {29802#true} assume 0 == ~mode2~0 % 256; {29802#true} is VALID [2022-02-20 19:54:19,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {29802#true} assume ~id3~0 >= 0; {29802#true} is VALID [2022-02-20 19:54:19,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {29802#true} assume 0 == ~st3~0; {29802#true} is VALID [2022-02-20 19:54:19,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {29802#true} assume ~send3~0 == ~id3~0; {29802#true} is VALID [2022-02-20 19:54:19,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {29802#true} assume 0 == ~mode3~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {29804#(= (+ (* (- 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; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {29804#(= (+ (* (- 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; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {29804#(= (+ (* (- 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; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {29804#(= (+ (* (- 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; {29804#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:19,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {29804#(= (+ (* (- 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; {29803#false} is VALID [2022-02-20 19:54:19,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {29803#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {29803#false} ~mode3~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {29803#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; {29803#false} is VALID [2022-02-20 19:54:19,786 INFO L290 TraceCheckUtils]: 81: Hoare triple {29803#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {29803#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {29803#false} ~mode4~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {29803#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; {29803#false} is VALID [2022-02-20 19:54:19,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {29803#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {29803#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {29803#false} ~mode5~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {29803#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; {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {29803#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {29803#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,788 INFO L290 TraceCheckUtils]: 91: Hoare triple {29803#false} ~mode6~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {29803#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; {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {29803#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {29803#false} assume !(node7_~m7~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {29803#false} ~mode7~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {29803#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {29803#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {29803#false} is VALID [2022-02-20 19:54:19,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {29803#false} assume !(node8_~m8~0#1 != ~nomsg~0); {29803#false} is VALID [2022-02-20 19:54:19,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {29803#false} ~mode8~0 := 0; {29803#false} is VALID [2022-02-20 19:54:19,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {29803#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29803#false} is VALID [2022-02-20 19:54:19,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {29803#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {29803#false} is VALID [2022-02-20 19:54:19,791 INFO L290 TraceCheckUtils]: 102: Hoare triple {29803#false} check_#res#1 := check_~tmp~1#1; {29803#false} is VALID [2022-02-20 19:54:19,791 INFO L290 TraceCheckUtils]: 103: Hoare triple {29803#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29803#false} is VALID [2022-02-20 19:54:19,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {29803#false} assume 0 == assert_~arg#1 % 256; {29803#false} is VALID [2022-02-20 19:54:19,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {29803#false} assume !false; {29803#false} is VALID [2022-02-20 19:54:19,792 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:54:19,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:19,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522898037] [2022-02-20 19:54:19,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522898037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:19,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:19,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:19,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126083853] [2022-02-20 19:54:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:19,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:19,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:19,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:19,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:19,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:19,858 INFO L87 Difference]: Start difference. First operand 2471 states and 3856 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:21,586 INFO L93 Difference]: Finished difference Result 2755 states and 4308 transitions. [2022-02-20 19:54:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:21,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:22,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:22,904 INFO L225 Difference]: With dead ends: 2755 [2022-02-20 19:54:22,905 INFO L226 Difference]: Without dead ends: 2607 [2022-02-20 19:54:22,905 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:54:22,907 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1545 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:22,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 1849 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2022-02-20 19:54:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2605. [2022-02-20 19:54:23,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:23,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2607 states. Second operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,039 INFO L74 IsIncluded]: Start isIncluded. First operand 2607 states. Second operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,042 INFO L87 Difference]: Start difference. First operand 2607 states. Second operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:23,411 INFO L93 Difference]: Finished difference Result 2607 states and 4070 transitions. [2022-02-20 19:54:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4070 transitions. [2022-02-20 19:54:23,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:23,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:23,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 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 2607 states. [2022-02-20 19:54:23,420 INFO L87 Difference]: Start difference. First operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 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 2607 states. [2022-02-20 19:54:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:23,646 INFO L93 Difference]: Finished difference Result 2607 states and 4070 transitions. [2022-02-20 19:54:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4070 transitions. [2022-02-20 19:54:23,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:23,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:23,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:23,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2603 states have (on average 1.5631963119477525) internal successors, (4069), 2604 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4069 transitions. [2022-02-20 19:54:23,964 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4069 transitions. Word has length 106 [2022-02-20 19:54:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:23,964 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 4069 transitions. [2022-02-20 19:54:23,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4069 transitions. [2022-02-20 19:54:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:23,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:23,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:23,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:23,970 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash 717259381, now seen corresponding path program 1 times [2022-02-20 19:54:23,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:23,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370481255] [2022-02-20 19:54:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:23,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:24,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {40523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {40523#true} is VALID [2022-02-20 19:54:24,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {40523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {40523#true} is VALID [2022-02-20 19:54:24,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {40523#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40523#true} is VALID [2022-02-20 19:54:24,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {40523#true} assume 0 == ~r1~0 % 256; {40523#true} is VALID [2022-02-20 19:54:24,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {40523#true} assume ~id1~0 >= 0; {40523#true} is VALID [2022-02-20 19:54:24,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {40523#true} assume 0 == ~st1~0; {40523#true} is VALID [2022-02-20 19:54:24,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {40523#true} assume ~send1~0 == ~id1~0; {40523#true} is VALID [2022-02-20 19:54:24,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {40523#true} assume 0 == ~mode1~0 % 256; {40523#true} is VALID [2022-02-20 19:54:24,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {40523#true} assume ~id2~0 >= 0; {40523#true} is VALID [2022-02-20 19:54:24,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {40523#true} assume 0 == ~st2~0; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {40523#true} assume ~send2~0 == ~id2~0; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {40523#true} assume 0 == ~mode2~0 % 256; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {40523#true} assume ~id3~0 >= 0; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {40523#true} assume 0 == ~st3~0; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {40523#true} assume ~send3~0 == ~id3~0; {40523#true} is VALID [2022-02-20 19:54:24,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {40523#true} assume 0 == ~mode3~0 % 256; {40523#true} is VALID [2022-02-20 19:54:24,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {40523#true} assume ~id4~0 >= 0; {40523#true} is VALID [2022-02-20 19:54:24,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {40523#true} assume 0 == ~st4~0; {40523#true} is VALID [2022-02-20 19:54:24,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {40523#true} assume ~send4~0 == ~id4~0; {40523#true} is VALID [2022-02-20 19:54:24,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {40523#true} assume 0 == ~mode4~0 % 256; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,212 INFO L290 TraceCheckUtils]: 78: Hoare triple {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {40525#(= (+ (* (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; {40525#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {40525#(= (+ (* (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; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {40524#false} assume !(node4_~m4~0#1 != ~nomsg~0); {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {40524#false} ~mode4~0 := 0; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {40524#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; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {40524#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 86: Hoare triple {40524#false} assume !(node5_~m5~0#1 != ~nomsg~0); {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 87: Hoare triple {40524#false} ~mode5~0 := 0; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 88: Hoare triple {40524#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; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 89: Hoare triple {40524#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 90: Hoare triple {40524#false} assume !(node6_~m6~0#1 != ~nomsg~0); {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 91: Hoare triple {40524#false} ~mode6~0 := 0; {40524#false} is VALID [2022-02-20 19:54:24,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {40524#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; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {40524#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 94: Hoare triple {40524#false} assume !(node7_~m7~0#1 != ~nomsg~0); {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {40524#false} ~mode7~0 := 0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {40524#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {40524#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 98: Hoare triple {40524#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 99: Hoare triple {40524#false} ~mode8~0 := 0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 100: Hoare triple {40524#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 101: Hoare triple {40524#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40524#false} is VALID [2022-02-20 19:54:24,214 INFO L290 TraceCheckUtils]: 102: Hoare triple {40524#false} check_#res#1 := check_~tmp~1#1; {40524#false} is VALID [2022-02-20 19:54:24,215 INFO L290 TraceCheckUtils]: 103: Hoare triple {40524#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40524#false} is VALID [2022-02-20 19:54:24,215 INFO L290 TraceCheckUtils]: 104: Hoare triple {40524#false} assume 0 == assert_~arg#1 % 256; {40524#false} is VALID [2022-02-20 19:54:24,215 INFO L290 TraceCheckUtils]: 105: Hoare triple {40524#false} assume !false; {40524#false} is VALID [2022-02-20 19:54:24,215 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:54:24,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:24,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370481255] [2022-02-20 19:54:24,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370481255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:24,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:24,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:24,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846577991] [2022-02-20 19:54:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:24,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:24,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:24,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:24,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:24,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:24,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:24,264 INFO L87 Difference]: Start difference. First operand 2605 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:26,204 INFO L93 Difference]: Finished difference Result 3145 states and 4927 transitions. [2022-02-20 19:54:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:26,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:27,967 INFO L225 Difference]: With dead ends: 3145 [2022-02-20 19:54:27,967 INFO L226 Difference]: Without dead ends: 2863 [2022-02-20 19:54:27,983 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:54:27,985 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1541 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:27,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 1848 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-02-20 19:54:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2861. [2022-02-20 19:54:28,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:28,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2863 states. Second operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,229 INFO L74 IsIncluded]: Start isIncluded. First operand 2863 states. Second operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,246 INFO L87 Difference]: Start difference. First operand 2863 states. Second operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:28,688 INFO L93 Difference]: Finished difference Result 2863 states and 4474 transitions. [2022-02-20 19:54:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4474 transitions. [2022-02-20 19:54:28,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:28,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:28,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 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 2863 states. [2022-02-20 19:54:28,717 INFO L87 Difference]: Start difference. First operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 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 2863 states. [2022-02-20 19:54:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:29,048 INFO L93 Difference]: Finished difference Result 2863 states and 4474 transitions. [2022-02-20 19:54:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4474 transitions. [2022-02-20 19:54:29,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:29,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:29,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:29,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2859 states have (on average 1.564533053515215) internal successors, (4473), 2860 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4473 transitions. [2022-02-20 19:54:29,281 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4473 transitions. Word has length 106 [2022-02-20 19:54:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:29,281 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 4473 transitions. [2022-02-20 19:54:29,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4473 transitions. [2022-02-20 19:54:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:29,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:29,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:29,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:54:29,283 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash -28323349, now seen corresponding path program 1 times [2022-02-20 19:54:29,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:29,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383886034] [2022-02-20 19:54:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:29,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {52512#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {52512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {52512#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {52512#true} assume 0 == ~r1~0 % 256; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {52512#true} assume ~id1~0 >= 0; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {52512#true} assume 0 == ~st1~0; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {52512#true} assume ~send1~0 == ~id1~0; {52512#true} is VALID [2022-02-20 19:54:29,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {52512#true} assume 0 == ~mode1~0 % 256; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {52512#true} assume ~id2~0 >= 0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {52512#true} assume 0 == ~st2~0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {52512#true} assume ~send2~0 == ~id2~0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {52512#true} assume 0 == ~mode2~0 % 256; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {52512#true} assume ~id3~0 >= 0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {52512#true} assume 0 == ~st3~0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {52512#true} assume ~send3~0 == ~id3~0; {52512#true} is VALID [2022-02-20 19:54:29,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {52512#true} assume 0 == ~mode3~0 % 256; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {52512#true} assume ~id4~0 >= 0; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {52512#true} assume 0 == ~st4~0; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {52512#true} assume ~send4~0 == ~id4~0; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {52512#true} assume 0 == ~mode4~0 % 256; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {52512#true} assume ~id5~0 >= 0; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {52512#true} assume 0 == ~st5~0; {52512#true} is VALID [2022-02-20 19:54:29,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {52512#true} assume ~send5~0 == ~id5~0; {52512#true} is VALID [2022-02-20 19:54:29,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {52512#true} assume 0 == ~mode5~0 % 256; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,371 INFO L290 TraceCheckUtils]: 64: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,373 INFO L290 TraceCheckUtils]: 69: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,374 INFO L290 TraceCheckUtils]: 70: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,374 INFO L290 TraceCheckUtils]: 71: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,374 INFO L290 TraceCheckUtils]: 72: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,377 INFO L290 TraceCheckUtils]: 79: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {52514#(= (+ (* (- 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; {52514#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:29,379 INFO L290 TraceCheckUtils]: 85: Hoare triple {52514#(= (+ (* (- 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; {52513#false} is VALID [2022-02-20 19:54:29,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {52513#false} assume !(node5_~m5~0#1 != ~nomsg~0); {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 87: Hoare triple {52513#false} ~mode5~0 := 0; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 88: Hoare triple {52513#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; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 89: Hoare triple {52513#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {52513#false} assume !(node6_~m6~0#1 != ~nomsg~0); {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 91: Hoare triple {52513#false} ~mode6~0 := 0; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {52513#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; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {52513#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {52513#false} is VALID [2022-02-20 19:54:29,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {52513#false} assume !(node7_~m7~0#1 != ~nomsg~0); {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 95: Hoare triple {52513#false} ~mode7~0 := 0; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 96: Hoare triple {52513#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 97: Hoare triple {52513#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {52513#false} assume !(node8_~m8~0#1 != ~nomsg~0); {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {52513#false} ~mode8~0 := 0; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 100: Hoare triple {52513#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 101: Hoare triple {52513#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 102: Hoare triple {52513#false} check_#res#1 := check_~tmp~1#1; {52513#false} is VALID [2022-02-20 19:54:29,381 INFO L290 TraceCheckUtils]: 103: Hoare triple {52513#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {52513#false} is VALID [2022-02-20 19:54:29,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {52513#false} assume 0 == assert_~arg#1 % 256; {52513#false} is VALID [2022-02-20 19:54:29,382 INFO L290 TraceCheckUtils]: 105: Hoare triple {52513#false} assume !false; {52513#false} is VALID [2022-02-20 19:54:29,382 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:54:29,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:29,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383886034] [2022-02-20 19:54:29,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383886034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:29,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:29,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:29,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259132564] [2022-02-20 19:54:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:29,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:29,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:29,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:29,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:29,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:29,478 INFO L87 Difference]: Start difference. First operand 2861 states and 4473 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:32,068 INFO L93 Difference]: Finished difference Result 3889 states and 6099 transitions. [2022-02-20 19:54:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:32,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:33,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:34,070 INFO L225 Difference]: With dead ends: 3889 [2022-02-20 19:54:34,070 INFO L226 Difference]: Without dead ends: 3351 [2022-02-20 19:54:34,072 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:54:34,073 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1537 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:34,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1847 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2022-02-20 19:54:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3349. [2022-02-20 19:54:34,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:34,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3351 states. Second operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,267 INFO L74 IsIncluded]: Start isIncluded. First operand 3351 states. Second operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,269 INFO L87 Difference]: Start difference. First operand 3351 states. Second operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:34,579 INFO L93 Difference]: Finished difference Result 3351 states and 5238 transitions. [2022-02-20 19:54:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 5238 transitions. [2022-02-20 19:54:34,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:34,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:34,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 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 3351 states. [2022-02-20 19:54:34,587 INFO L87 Difference]: Start difference. First operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 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 3351 states. [2022-02-20 19:54:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:34,926 INFO L93 Difference]: Finished difference Result 3351 states and 5238 transitions. [2022-02-20 19:54:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 5238 transitions. [2022-02-20 19:54:34,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:34,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:34,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:34,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 3347 states have (on average 1.5646847923513594) internal successors, (5237), 3348 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 5237 transitions. [2022-02-20 19:54:35,345 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 5237 transitions. Word has length 106 [2022-02-20 19:54:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:35,346 INFO L470 AbstractCegarLoop]: Abstraction has 3349 states and 5237 transitions. [2022-02-20 19:54:35,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 5237 transitions. [2022-02-20 19:54:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:35,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:35,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:35,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:54:35,347 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354207, now seen corresponding path program 1 times [2022-02-20 19:54:35,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:35,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940148773] [2022-02-20 19:54:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:35,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {66929#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {66929#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {66929#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {66929#true} assume 0 == ~r1~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {66929#true} assume ~id1~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {66929#true} assume 0 == ~st1~0; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {66929#true} assume ~send1~0 == ~id1~0; {66929#true} is VALID [2022-02-20 19:54:35,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {66929#true} assume 0 == ~mode1~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {66929#true} assume ~id2~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {66929#true} assume 0 == ~st2~0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {66929#true} assume ~send2~0 == ~id2~0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {66929#true} assume 0 == ~mode2~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {66929#true} assume ~id3~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {66929#true} assume 0 == ~st3~0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {66929#true} assume ~send3~0 == ~id3~0; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {66929#true} assume 0 == ~mode3~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {66929#true} assume ~id4~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {66929#true} assume 0 == ~st4~0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {66929#true} assume ~send4~0 == ~id4~0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {66929#true} assume 0 == ~mode4~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {66929#true} assume ~id5~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {66929#true} assume 0 == ~st5~0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {66929#true} assume ~send5~0 == ~id5~0; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {66929#true} assume 0 == ~mode5~0 % 256; {66929#true} is VALID [2022-02-20 19:54:35,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {66929#true} assume ~id6~0 >= 0; {66929#true} is VALID [2022-02-20 19:54:35,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {66929#true} assume 0 == ~st6~0; {66929#true} is VALID [2022-02-20 19:54:35,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {66929#true} assume ~send6~0 == ~id6~0; {66929#true} is VALID [2022-02-20 19:54:35,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {66929#true} assume 0 == ~mode6~0 % 256; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,527 INFO L290 TraceCheckUtils]: 64: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,533 INFO L290 TraceCheckUtils]: 78: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,534 INFO L290 TraceCheckUtils]: 81: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,534 INFO L290 TraceCheckUtils]: 82: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,534 INFO L290 TraceCheckUtils]: 83: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,535 INFO L290 TraceCheckUtils]: 84: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,535 INFO L290 TraceCheckUtils]: 86: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,536 INFO L290 TraceCheckUtils]: 88: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:35,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {66931#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {66930#false} is VALID [2022-02-20 19:54:35,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {66930#false} assume !(node6_~m6~0#1 != ~nomsg~0); {66930#false} is VALID [2022-02-20 19:54:35,537 INFO L290 TraceCheckUtils]: 91: Hoare triple {66930#false} ~mode6~0 := 0; {66930#false} is VALID [2022-02-20 19:54:35,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {66930#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; {66930#false} is VALID [2022-02-20 19:54:35,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {66930#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {66930#false} assume !(node7_~m7~0#1 != ~nomsg~0); {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 95: Hoare triple {66930#false} ~mode7~0 := 0; {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 96: Hoare triple {66930#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 97: Hoare triple {66930#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 98: Hoare triple {66930#false} assume !(node8_~m8~0#1 != ~nomsg~0); {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {66930#false} ~mode8~0 := 0; {66930#false} is VALID [2022-02-20 19:54:35,538 INFO L290 TraceCheckUtils]: 100: Hoare triple {66930#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {66930#false} is VALID [2022-02-20 19:54:35,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {66930#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {66930#false} is VALID [2022-02-20 19:54:35,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {66930#false} check_#res#1 := check_~tmp~1#1; {66930#false} is VALID [2022-02-20 19:54:35,539 INFO L290 TraceCheckUtils]: 103: Hoare triple {66930#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {66930#false} is VALID [2022-02-20 19:54:35,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {66930#false} assume 0 == assert_~arg#1 % 256; {66930#false} is VALID [2022-02-20 19:54:35,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {66930#false} assume !false; {66930#false} is VALID [2022-02-20 19:54:35,540 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:54:35,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:35,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940148773] [2022-02-20 19:54:35,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940148773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:35,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:35,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:35,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580578236] [2022-02-20 19:54:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:35,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:35,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:35,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:35,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:35,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:35,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:35,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:35,616 INFO L87 Difference]: Start difference. First operand 3349 states and 5237 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:38,604 INFO L93 Difference]: Finished difference Result 5305 states and 8311 transitions. [2022-02-20 19:54:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:38,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:40,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:40,920 INFO L225 Difference]: With dead ends: 5305 [2022-02-20 19:54:40,921 INFO L226 Difference]: Without dead ends: 4279 [2022-02-20 19:54:40,923 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:54:40,923 INFO L933 BasicCegarLoop]: 1704 mSDtfsCounter, 1533 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:40,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1846 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2022-02-20 19:54:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4277. [2022-02-20 19:54:41,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:41,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4279 states. Second operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,353 INFO L74 IsIncluded]: Start isIncluded. First operand 4279 states. Second operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,359 INFO L87 Difference]: Start difference. First operand 4279 states. Second operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,856 INFO L93 Difference]: Finished difference Result 4279 states and 6678 transitions. [2022-02-20 19:54:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 6678 transitions. [2022-02-20 19:54:41,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 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 4279 states. [2022-02-20 19:54:41,871 INFO L87 Difference]: Start difference. First operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 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 4279 states. [2022-02-20 19:54:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,475 INFO L93 Difference]: Finished difference Result 4279 states and 6678 transitions. [2022-02-20 19:54:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 6678 transitions. [2022-02-20 19:54:42,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:42,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:42,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:42,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4277 states, 4275 states have (on average 1.5618713450292399) internal successors, (6677), 4276 states have internal predecessors, (6677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 6677 transitions. [2022-02-20 19:54:43,124 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 6677 transitions. Word has length 106 [2022-02-20 19:54:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:43,125 INFO L470 AbstractCegarLoop]: Abstraction has 4277 states and 6677 transitions. [2022-02-20 19:54:43,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 6677 transitions. [2022-02-20 19:54:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:43,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:43,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:43,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:54:43,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash 732328407, now seen corresponding path program 1 times [2022-02-20 19:54:43,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:43,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214844454] [2022-02-20 19:54:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:43,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {85986#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {85986#true} is VALID [2022-02-20 19:54:43,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {85986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {85986#true} is VALID [2022-02-20 19:54:43,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {85986#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {85986#true} is VALID [2022-02-20 19:54:43,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {85986#true} assume 0 == ~r1~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {85986#true} assume ~id1~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {85986#true} assume 0 == ~st1~0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {85986#true} assume ~send1~0 == ~id1~0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {85986#true} assume 0 == ~mode1~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {85986#true} assume ~id2~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {85986#true} assume 0 == ~st2~0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {85986#true} assume ~send2~0 == ~id2~0; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {85986#true} assume 0 == ~mode2~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {85986#true} assume ~id3~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {85986#true} assume 0 == ~st3~0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {85986#true} assume ~send3~0 == ~id3~0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {85986#true} assume 0 == ~mode3~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {85986#true} assume ~id4~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {85986#true} assume 0 == ~st4~0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {85986#true} assume ~send4~0 == ~id4~0; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {85986#true} assume 0 == ~mode4~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {85986#true} assume ~id5~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {85986#true} assume 0 == ~st5~0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {85986#true} assume ~send5~0 == ~id5~0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {85986#true} assume 0 == ~mode5~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {85986#true} assume ~id6~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {85986#true} assume 0 == ~st6~0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {85986#true} assume ~send6~0 == ~id6~0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {85986#true} assume 0 == ~mode6~0 % 256; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {85986#true} assume ~id7~0 >= 0; {85986#true} is VALID [2022-02-20 19:54:43,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {85986#true} assume 0 == ~st7~0; {85986#true} is VALID [2022-02-20 19:54:43,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {85986#true} assume ~send7~0 == ~id7~0; {85986#true} is VALID [2022-02-20 19:54:43,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {85986#true} assume 0 == ~mode7~0 % 256; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,200 INFO L290 TraceCheckUtils]: 73: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,202 INFO L290 TraceCheckUtils]: 77: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,203 INFO L290 TraceCheckUtils]: 80: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,203 INFO L290 TraceCheckUtils]: 82: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,205 INFO L290 TraceCheckUtils]: 86: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,206 INFO L290 TraceCheckUtils]: 88: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,206 INFO L290 TraceCheckUtils]: 89: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,206 INFO L290 TraceCheckUtils]: 90: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,207 INFO L290 TraceCheckUtils]: 92: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:54:43,207 INFO L290 TraceCheckUtils]: 93: Hoare triple {85988#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 94: Hoare triple {85987#false} assume !(node7_~m7~0#1 != ~nomsg~0); {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 95: Hoare triple {85987#false} ~mode7~0 := 0; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 96: Hoare triple {85987#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 97: Hoare triple {85987#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 98: Hoare triple {85987#false} assume !(node8_~m8~0#1 != ~nomsg~0); {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 99: Hoare triple {85987#false} ~mode8~0 := 0; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 100: Hoare triple {85987#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {85987#false} is VALID [2022-02-20 19:54:43,208 INFO L290 TraceCheckUtils]: 101: Hoare triple {85987#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {85987#false} is VALID [2022-02-20 19:54:43,209 INFO L290 TraceCheckUtils]: 102: Hoare triple {85987#false} check_#res#1 := check_~tmp~1#1; {85987#false} is VALID [2022-02-20 19:54:43,209 INFO L290 TraceCheckUtils]: 103: Hoare triple {85987#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {85987#false} is VALID [2022-02-20 19:54:43,209 INFO L290 TraceCheckUtils]: 104: Hoare triple {85987#false} assume 0 == assert_~arg#1 % 256; {85987#false} is VALID [2022-02-20 19:54:43,209 INFO L290 TraceCheckUtils]: 105: Hoare triple {85987#false} assume !false; {85987#false} is VALID [2022-02-20 19:54:43,209 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:54:43,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:43,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214844454] [2022-02-20 19:54:43,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214844454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:43,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:43,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:43,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629969660] [2022-02-20 19:54:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-20 19:54:43,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:43,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:43,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:43,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:43,281 INFO L87 Difference]: Start difference. First operand 4277 states and 6677 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)