./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c167e2ddaf8948d5e7bd26982f4dbc66059753c7303cdae96f611484751ca27 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:47:02,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:47:02,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:47:02,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:47:02,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:47:02,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:47:02,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:47:02,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:47:02,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:47:02,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:47:02,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:47:02,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:47:02,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:47:02,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:47:02,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:47:02,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:47:02,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:47:02,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:47:02,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:47:02,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:47:02,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:47:02,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:47:02,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:47:02,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:47:02,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:47:02,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:47:02,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:47:02,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:47:02,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:47:02,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:47:02,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:47:02,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:47:02,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:47:02,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:47:02,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:47:02,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:47:02,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:47:02,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:47:02,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:47:02,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:47:02,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:47:02,664 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:47:02,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:47:02,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:47:02,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:47:02,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:47:02,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:47:02,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:47:02,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:47:02,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:47:02,694 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:47:02,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:47:02,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:47:02,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:47:02,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:47:02,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:02,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:47:02,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:47:02,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:47:02,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:47:02,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:47:02,698 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:47:02,698 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:47:02,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:47:02,699 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 -> 2c167e2ddaf8948d5e7bd26982f4dbc66059753c7303cdae96f611484751ca27 [2022-02-20 19:47:02,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:47:02,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:47:02,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:47:02,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:47:02,899 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:47:02,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2022-02-20 19:47:02,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30db2c6d9/e4fef47c5a094136b6798a880921f022/FLAG083d6aeb3 [2022-02-20 19:47:03,514 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:47:03,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2022-02-20 19:47:03,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30db2c6d9/e4fef47c5a094136b6798a880921f022/FLAG083d6aeb3 [2022-02-20 19:47:03,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30db2c6d9/e4fef47c5a094136b6798a880921f022 [2022-02-20 19:47:03,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:47:03,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:47:03,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:03,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:47:03,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:47:03,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:03" (1/1) ... [2022-02-20 19:47:03,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc161bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:03, skipping insertion in model container [2022-02-20 19:47:03,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:47:03" (1/1) ... [2022-02-20 19:47:03,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:47:04,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:47:04,350 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.6.ufo.BOUNDED-12.pals+Problem12_label05.c[15482,15495] [2022-02-20 19:47:04,400 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.6.ufo.BOUNDED-12.pals+Problem12_label05.c[22418,22431] [2022-02-20 19:47:04,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:04,884 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:47:04,922 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.6.ufo.BOUNDED-12.pals+Problem12_label05.c[15482,15495] [2022-02-20 19:47:04,937 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.6.ufo.BOUNDED-12.pals+Problem12_label05.c[22418,22431] [2022-02-20 19:47:05,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:47:05,271 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:47:05,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05 WrapperNode [2022-02-20 19:47:05,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:47:05,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:05,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:47:05,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:47:05,277 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:47:05" (1/1) ... [2022-02-20 19:47:05,314 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:47:05" (1/1) ... [2022-02-20 19:47:05,667 INFO L137 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2022-02-20 19:47:05,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:47:05,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:47:05,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:47:05,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:47:05,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:47:05,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:47:05,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:47:05,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:47:05,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (1/1) ... [2022-02-20 19:47:05,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:47:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:47:06,004 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:47:06,013 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:47:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:47:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:47:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:47:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:47:06,132 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:47:06,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:47:12,317 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:47:12,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:47:12,328 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:47:12,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:12 BoogieIcfgContainer [2022-02-20 19:47:12,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:47:12,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:47:12,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:47:12,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:47:12,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:47:03" (1/3) ... [2022-02-20 19:47:12,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141de1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:12, skipping insertion in model container [2022-02-20 19:47:12,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:47:05" (2/3) ... [2022-02-20 19:47:12,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141de1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:47:12, skipping insertion in model container [2022-02-20 19:47:12,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:47:12" (3/3) ... [2022-02-20 19:47:12,335 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label05.c [2022-02-20 19:47:12,337 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:47:12,338 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:47:12,369 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:47:12,373 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:47:12,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:47:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have 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:47:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:12,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:12,412 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] [2022-02-20 19:47:12,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 340623278, now seen corresponding path program 1 times [2022-02-20 19:47:12,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:12,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187372347] [2022-02-20 19:47:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:12,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {929#true} is VALID [2022-02-20 19:47:12,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {929#true} is VALID [2022-02-20 19:47:12,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {929#true} is VALID [2022-02-20 19:47:12,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {929#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {929#true} is VALID [2022-02-20 19:47:12,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {929#true} init_#res#1 := init_~tmp~0#1; {929#true} is VALID [2022-02-20 19:47:12,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {929#true} is VALID [2022-02-20 19:47:12,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {930#false} is VALID [2022-02-20 19:47:12,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {930#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;main1_~i2~0#1 := 0; {930#false} is VALID [2022-02-20 19:47:12,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {930#false} assume !!(main1_~i2~0#1 < 12);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; {930#false} is VALID [2022-02-20 19:47:12,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {930#false} is VALID [2022-02-20 19:47:12,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#false} assume !(node1_~m1~0#1 != ~nomsg~0); {930#false} is VALID [2022-02-20 19:47:12,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#false} ~mode1~0 := 0; {930#false} is VALID [2022-02-20 19:47:12,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:12,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {930#false} assume !(0 != ~mode2~0 % 256); {930#false} is VALID [2022-02-20 19:47:12,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {930#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {930#false} is VALID [2022-02-20 19:47:12,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#false} ~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; {930#false} is VALID [2022-02-20 19:47:12,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:12,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} assume !(0 != ~mode3~0 % 256); {930#false} is VALID [2022-02-20 19:47:12,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {930#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {930#false} is VALID [2022-02-20 19:47:12,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {930#false} ~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; {930#false} is VALID [2022-02-20 19:47:12,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:12,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#false} assume !(0 != ~mode4~0 % 256); {930#false} is VALID [2022-02-20 19:47:12,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {930#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {930#false} is VALID [2022-02-20 19:47:12,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {930#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {930#false} is VALID [2022-02-20 19:47:12,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:12,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {930#false} assume !(0 != ~mode5~0 % 256); {930#false} is VALID [2022-02-20 19:47:12,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {930#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {930#false} is VALID [2022-02-20 19:47:12,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {930#false} is VALID [2022-02-20 19:47:12,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {930#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; {930#false} is VALID [2022-02-20 19:47:12,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {930#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {930#false} is VALID [2022-02-20 19:47:12,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {930#false} assume !(node6_~m6~0#1 != ~nomsg~0); {930#false} is VALID [2022-02-20 19:47:12,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {930#false} ~mode6~0 := 0; {930#false} is VALID [2022-02-20 19:47:12,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {930#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {930#false} is VALID [2022-02-20 19:47:12,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {930#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {930#false} is VALID [2022-02-20 19:47:12,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {930#false} check_#res#1 := check_~tmp~1#1; {930#false} is VALID [2022-02-20 19:47:12,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {930#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {930#false} is VALID [2022-02-20 19:47:12,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {930#false} assume 0 == assert_~arg#1 % 256; {930#false} is VALID [2022-02-20 19:47:12,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-02-20 19:47:12,657 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:47:12,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:12,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187372347] [2022-02-20 19:47:12,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187372347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:12,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:12,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:47:12,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481914917] [2022-02-20 19:47:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:12,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:12,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:12,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:12,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:47:12,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:47:12,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:47:12,722 INFO L87 Difference]: Start difference. First operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:13,907 INFO L93 Difference]: Finished difference Result 1806 states and 3418 transitions. [2022-02-20 19:47:13,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:47:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3418 transitions. [2022-02-20 19:47:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3418 transitions. [2022-02-20 19:47:13,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3418 transitions. [2022-02-20 19:47:16,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3418 edges. 3418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:16,452 INFO L225 Difference]: With dead ends: 1806 [2022-02-20 19:47:16,452 INFO L226 Difference]: Without dead ends: 860 [2022-02-20 19:47:16,456 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:47:16,459 INFO L933 BasicCegarLoop]: 1687 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, 1687 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:47:16,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-20 19:47:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2022-02-20 19:47:16,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:16,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have 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:47:16,505 INFO L74 IsIncluded]: Start isIncluded. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have 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:47:16,507 INFO L87 Difference]: Start difference. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have 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:47:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:16,536 INFO L93 Difference]: Finished difference Result 860 states and 1620 transitions. [2022-02-20 19:47:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:16,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:16,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:16,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:16,543 INFO L87 Difference]: Start difference. First operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:16,572 INFO L93 Difference]: Finished difference Result 860 states and 1620 transitions. [2022-02-20 19:47:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:16,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:16,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:16,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:16,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.8881118881118881) internal successors, (1620), 859 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have 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:47:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1620 transitions. [2022-02-20 19:47:16,608 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1620 transitions. Word has length 38 [2022-02-20 19:47:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:16,608 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1620 transitions. [2022-02-20 19:47:16,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1620 transitions. [2022-02-20 19:47:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:47:16,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:16,609 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] [2022-02-20 19:47:16,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:47:16,610 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 615382892, now seen corresponding path program 1 times [2022-02-20 19:47:16,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:16,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673743661] [2022-02-20 19:47:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:16,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {5367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {5367#true} is VALID [2022-02-20 19:47:16,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {5367#true} is VALID [2022-02-20 19:47:16,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5367#true} is VALID [2022-02-20 19:47:16,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {5367#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5369#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:47:16,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {5369#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5370#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:47:16,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {5370#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {5371#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:47:16,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {5371#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5368#false} is VALID [2022-02-20 19:47:16,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {5368#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;main1_~i2~0#1 := 0; {5368#false} is VALID [2022-02-20 19:47:16,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {5368#false} assume !!(main1_~i2~0#1 < 12);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; {5368#false} is VALID [2022-02-20 19:47:16,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {5368#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5368#false} is VALID [2022-02-20 19:47:16,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {5368#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5368#false} is VALID [2022-02-20 19:47:16,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {5368#false} ~mode1~0 := 0; {5368#false} is VALID [2022-02-20 19:47:16,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:16,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {5368#false} assume !(0 != ~mode2~0 % 256); {5368#false} is VALID [2022-02-20 19:47:16,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {5368#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {5368#false} is VALID [2022-02-20 19:47:16,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {5368#false} ~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; {5368#false} is VALID [2022-02-20 19:47:16,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:16,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#false} assume !(0 != ~mode3~0 % 256); {5368#false} is VALID [2022-02-20 19:47:16,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {5368#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {5368#false} ~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; {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {5368#false} assume !(0 != ~mode4~0 % 256); {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {5368#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {5368#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5368#false} is VALID [2022-02-20 19:47:16,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:16,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {5368#false} assume !(0 != ~mode5~0 % 256); {5368#false} is VALID [2022-02-20 19:47:16,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {5368#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {5368#false} is VALID [2022-02-20 19:47:16,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {5368#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {5368#false} is VALID [2022-02-20 19:47:16,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {5368#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; {5368#false} is VALID [2022-02-20 19:47:16,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {5368#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5368#false} is VALID [2022-02-20 19:47:16,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {5368#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5368#false} is VALID [2022-02-20 19:47:16,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {5368#false} ~mode6~0 := 0; {5368#false} is VALID [2022-02-20 19:47:16,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {5368#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5368#false} is VALID [2022-02-20 19:47:16,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {5368#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5368#false} is VALID [2022-02-20 19:47:16,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {5368#false} check_#res#1 := check_~tmp~1#1; {5368#false} is VALID [2022-02-20 19:47:16,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {5368#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {5368#false} is VALID [2022-02-20 19:47:16,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {5368#false} assume 0 == assert_~arg#1 % 256; {5368#false} is VALID [2022-02-20 19:47:16,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-02-20 19:47:16,693 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:47:16,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:16,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673743661] [2022-02-20 19:47:16,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673743661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:16,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:16,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:47:16,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866294005] [2022-02-20 19:47:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:16,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:16,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:16,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:16,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:47:16,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:47:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:47:16,719 INFO L87 Difference]: Start difference. First operand 860 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:20,509 INFO L93 Difference]: Finished difference Result 924 states and 1719 transitions. [2022-02-20 19:47:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:20,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:20,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1719 transitions. [2022-02-20 19:47:21,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:21,749 INFO L225 Difference]: With dead ends: 924 [2022-02-20 19:47:21,749 INFO L226 Difference]: Without dead ends: 860 [2022-02-20 19:47:21,752 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:47:21,754 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:21,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-20 19:47:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2022-02-20 19:47:21,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:21,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have 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:47:21,769 INFO L74 IsIncluded]: Start isIncluded. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have 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:47:21,771 INFO L87 Difference]: Start difference. First operand 860 states. Second operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have 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:47:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:21,800 INFO L93 Difference]: Finished difference Result 860 states and 1580 transitions. [2022-02-20 19:47:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:21,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:21,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:21,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:21,804 INFO L87 Difference]: Start difference. First operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 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 860 states. [2022-02-20 19:47:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:21,838 INFO L93 Difference]: Finished difference Result 860 states and 1580 transitions. [2022-02-20 19:47:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:21,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:21,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:21,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:21,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 1.8414918414918415) internal successors, (1580), 859 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have 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:47:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1580 transitions. [2022-02-20 19:47:21,864 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1580 transitions. Word has length 38 [2022-02-20 19:47:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:21,865 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1580 transitions. [2022-02-20 19:47:21,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1580 transitions. [2022-02-20 19:47:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 19:47:21,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:21,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:21,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:21,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -117834811, now seen corresponding path program 1 times [2022-02-20 19:47:21,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:21,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160118234] [2022-02-20 19:47:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:22,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {8922#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet53#1);havoc main_#t~nondet53#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet51#1, main2_#t~ret52#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet51#1 && main2_#t~nondet51#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet51#1;havoc main2_#t~nondet51#1; {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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~ret48#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:47:22,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {8924#(and (<= ~a2~0 170) (= (+ ~a5~0 (- 4)) 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); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8925#(not (= (+ ~a7~0 (- 12)) 0))} is VALID [2022-02-20 19:47:22,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {8925#(not (= (+ ~a7~0 (- 12)) 0))} assume (((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8923#false} is VALID [2022-02-20 19:47:22,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {8923#false} assume !false; {8923#false} is VALID [2022-02-20 19:47:22,057 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:47:22,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:22,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160118234] [2022-02-20 19:47:22,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160118234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:22,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:22,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:22,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33829533] [2022-02-20 19:47:22,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 19:47:22,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:22,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:22,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:22,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:47:22,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:47:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:47:22,102 INFO L87 Difference]: Start difference. First operand 860 states and 1580 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:33,560 INFO L93 Difference]: Finished difference Result 3115 states and 5889 transitions. [2022-02-20 19:47:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:47:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 19:47:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5889 transitions. [2022-02-20 19:47:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5889 transitions. [2022-02-20 19:47:33,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5889 transitions. [2022-02-20 19:47:37,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5889 edges. 5889 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:38,108 INFO L225 Difference]: With dead ends: 3115 [2022-02-20 19:47:38,108 INFO L226 Difference]: Without dead ends: 2362 [2022-02-20 19:47:38,109 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:47:38,110 INFO L933 BasicCegarLoop]: 834 mSDtfsCounter, 2463 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:38,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2463 Valid, 852 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-02-20 19:47:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-02-20 19:47:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-02-20 19:47:38,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:38,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have 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:47:38,159 INFO L74 IsIncluded]: Start isIncluded. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have 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:47:38,163 INFO L87 Difference]: Start difference. First operand 2362 states. Second operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have 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:47:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:38,306 INFO L93 Difference]: Finished difference Result 2362 states and 3706 transitions. [2022-02-20 19:47:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3706 transitions. [2022-02-20 19:47:38,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:38,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:38,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 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 2362 states. [2022-02-20 19:47:38,316 INFO L87 Difference]: Start difference. First operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 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 2362 states. [2022-02-20 19:47:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:38,463 INFO L93 Difference]: Finished difference Result 2362 states and 3706 transitions. [2022-02-20 19:47:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3706 transitions. [2022-02-20 19:47:38,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:38,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:38,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:38,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2360 states have (on average 1.5703389830508474) internal successors, (3706), 2361 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have 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:47:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3706 transitions. [2022-02-20 19:47:38,627 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3706 transitions. Word has length 60 [2022-02-20 19:47:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:38,627 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 3706 transitions. [2022-02-20 19:47:38,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3706 transitions. [2022-02-20 19:47:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:38,628 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:38,628 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] [2022-02-20 19:47:38,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:47:38,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2101054792, now seen corresponding path program 1 times [2022-02-20 19:47:38,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:38,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952434726] [2022-02-20 19:47:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:38,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {19186#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {19186#true} is VALID [2022-02-20 19:47:38,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {19186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {19186#true} is VALID [2022-02-20 19:47:38,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {19186#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19186#true} is VALID [2022-02-20 19:47:38,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {19186#true} assume 0 == ~r1~0; {19186#true} is VALID [2022-02-20 19:47:38,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {19186#true} assume ~id1~0 >= 0; {19186#true} is VALID [2022-02-20 19:47:38,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {19186#true} assume 0 == ~st1~0; {19186#true} is VALID [2022-02-20 19:47:38,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {19186#true} assume ~send1~0 == ~id1~0; {19186#true} is VALID [2022-02-20 19:47:38,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {19186#true} assume 0 == ~mode1~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:38,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {19188#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {19187#false} assume !(node1_~m1~0#1 != ~nomsg~0); {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {19187#false} ~mode1~0 := 0; {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {19187#false} assume !(0 != ~mode2~0 % 256); {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {19187#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {19187#false} ~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; {19187#false} is VALID [2022-02-20 19:47:38,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {19187#false} assume !(0 != ~mode3~0 % 256); {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {19187#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {19187#false} ~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; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {19187#false} assume !(0 != ~mode4~0 % 256); {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {19187#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {19187#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {19187#false} is VALID [2022-02-20 19:47:38,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {19187#false} assume !(0 != ~mode5~0 % 256); {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {19187#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {19187#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {19187#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; {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {19187#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {19187#false} assume !(node6_~m6~0#1 != ~nomsg~0); {19187#false} is VALID [2022-02-20 19:47:38,703 INFO L290 TraceCheckUtils]: 70: Hoare triple {19187#false} ~mode6~0 := 0; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {19187#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {19187#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {19187#false} check_#res#1 := check_~tmp~1#1; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {19187#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {19187#false} assume 0 == assert_~arg#1 % 256; {19187#false} is VALID [2022-02-20 19:47:38,704 INFO L290 TraceCheckUtils]: 76: Hoare triple {19187#false} assume !false; {19187#false} is VALID [2022-02-20 19:47:38,705 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:47:38,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:38,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952434726] [2022-02-20 19:47:38,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952434726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:38,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:38,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:38,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436102318] [2022-02-20 19:47:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:38,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:38,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:38,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:38,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:38,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:38,752 INFO L87 Difference]: Start difference. First operand 2362 states and 3706 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:40,507 INFO L93 Difference]: Finished difference Result 2476 states and 3886 transitions. [2022-02-20 19:47:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:40,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:41,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:42,023 INFO L225 Difference]: With dead ends: 2476 [2022-02-20 19:47:42,024 INFO L226 Difference]: Without dead ends: 2416 [2022-02-20 19:47:42,024 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:47:42,030 INFO L933 BasicCegarLoop]: 1661 mSDtfsCounter, 1524 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1754 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:47:42,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-02-20 19:47:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2414. [2022-02-20 19:47:42,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:42,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:42,084 INFO L74 IsIncluded]: Start isIncluded. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:42,086 INFO L87 Difference]: Start difference. First operand 2416 states. Second operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:42,232 INFO L93 Difference]: Finished difference Result 2416 states and 3790 transitions. [2022-02-20 19:47:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3790 transitions. [2022-02-20 19:47:42,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:42,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:42,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 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 2416 states. [2022-02-20 19:47:42,240 INFO L87 Difference]: Start difference. First operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 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 2416 states. [2022-02-20 19:47:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:42,387 INFO L93 Difference]: Finished difference Result 2416 states and 3790 transitions. [2022-02-20 19:47:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3790 transitions. [2022-02-20 19:47:42,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:42,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:42,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:42,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2412 states have (on average 1.5708955223880596) internal successors, (3789), 2413 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3789 transitions. [2022-02-20 19:47:42,545 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3789 transitions. Word has length 77 [2022-02-20 19:47:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:42,545 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 3789 transitions. [2022-02-20 19:47:42,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3789 transitions. [2022-02-20 19:47:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:42,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:42,546 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] [2022-02-20 19:47:42,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:47:42,546 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1452480302, now seen corresponding path program 1 times [2022-02-20 19:47:42,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:42,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275728086] [2022-02-20 19:47:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:42,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {28990#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {28990#true} is VALID [2022-02-20 19:47:42,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {28990#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {28990#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {28990#true} assume 0 == ~r1~0; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {28990#true} assume ~id1~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {28990#true} assume 0 == ~st1~0; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {28990#true} assume ~send1~0 == ~id1~0; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {28990#true} assume 0 == ~mode1~0 % 256; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {28990#true} assume ~id2~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {28990#true} assume 0 == ~st2~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {28990#true} assume ~send2~0 == ~id2~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {28990#true} assume 0 == ~mode2~0 % 256; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {28990#true} assume ~id3~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {28990#true} assume 0 == ~st3~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {28990#true} assume ~send3~0 == ~id3~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {28990#true} assume 0 == ~mode3~0 % 256; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {28990#true} assume ~id4~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {28990#true} assume 0 == ~st4~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {28990#true} assume ~send4~0 == ~id4~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {28990#true} assume 0 == ~mode4~0 % 256; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {28990#true} assume ~id5~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {28990#true} assume 0 == ~st5~0; {28990#true} is VALID [2022-02-20 19:47:42,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {28990#true} assume ~send5~0 == ~id5~0; {28990#true} is VALID [2022-02-20 19:47:42,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {28990#true} assume 0 == ~mode5~0 % 256; {28990#true} is VALID [2022-02-20 19:47:42,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {28990#true} assume ~id6~0 >= 0; {28990#true} is VALID [2022-02-20 19:47:42,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {28990#true} assume 0 == ~st6~0; {28990#true} is VALID [2022-02-20 19:47:42,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {28990#true} assume ~send6~0 == ~id6~0; {28990#true} is VALID [2022-02-20 19:47:42,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {28990#true} assume 0 == ~mode6~0 % 256; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {28992#(= (+ (* (- 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;main1_~i2~0#1 := 0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,674 INFO L290 TraceCheckUtils]: 63: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {28992#(= (+ (* (- 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; {28992#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:42,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {28992#(= (+ (* (- 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; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 69: Hoare triple {28991#false} assume !(node6_~m6~0#1 != ~nomsg~0); {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 70: Hoare triple {28991#false} ~mode6~0 := 0; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {28991#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 72: Hoare triple {28991#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {28991#false} check_#res#1 := check_~tmp~1#1; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {28991#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {28991#false} assume 0 == assert_~arg#1 % 256; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L290 TraceCheckUtils]: 76: Hoare triple {28991#false} assume !false; {28991#false} is VALID [2022-02-20 19:47:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:47:42,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:42,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275728086] [2022-02-20 19:47:42,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275728086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:42,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:42,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:42,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353613631] [2022-02-20 19:47:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:42,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:42,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:42,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:42,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:42,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:42,724 INFO L87 Difference]: Start difference. First operand 2414 states and 3789 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:44,472 INFO L93 Difference]: Finished difference Result 2626 states and 4125 transitions. [2022-02-20 19:47:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:44,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:45,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:45,998 INFO L225 Difference]: With dead ends: 2626 [2022-02-20 19:47:45,998 INFO L226 Difference]: Without dead ends: 2514 [2022-02-20 19:47:45,999 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:47:45,999 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1504 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1717 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:47:46,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-02-20 19:47:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2512. [2022-02-20 19:47:46,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:46,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have 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:47:46,064 INFO L74 IsIncluded]: Start isIncluded. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have 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:47:46,066 INFO L87 Difference]: Start difference. First operand 2514 states. Second operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have 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:47:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:46,222 INFO L93 Difference]: Finished difference Result 2514 states and 3945 transitions. [2022-02-20 19:47:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3945 transitions. [2022-02-20 19:47:46,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:46,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:46,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 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 2514 states. [2022-02-20 19:47:46,229 INFO L87 Difference]: Start difference. First operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 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 2514 states. [2022-02-20 19:47:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:46,388 INFO L93 Difference]: Finished difference Result 2514 states and 3945 transitions. [2022-02-20 19:47:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3945 transitions. [2022-02-20 19:47:46,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:46,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:46,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:46,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2510 states have (on average 1.5713147410358566) internal successors, (3944), 2511 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have 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:47:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3944 transitions. [2022-02-20 19:47:46,560 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3944 transitions. Word has length 77 [2022-02-20 19:47:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:46,560 INFO L470 AbstractCegarLoop]: Abstraction has 2512 states and 3944 transitions. [2022-02-20 19:47:46,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3944 transitions. [2022-02-20 19:47:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:46,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:46,561 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] [2022-02-20 19:47:46,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:47:46,561 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1624501596, now seen corresponding path program 1 times [2022-02-20 19:47:46,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:46,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112311351] [2022-02-20 19:47:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {39283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {39283#true} is VALID [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {39283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {39283#true} is VALID [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {39283#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39283#true} is VALID [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {39283#true} assume 0 == ~r1~0; {39283#true} is VALID [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {39283#true} assume ~id1~0 >= 0; {39283#true} is VALID [2022-02-20 19:47:46,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {39283#true} assume 0 == ~st1~0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:46,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {39285#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:46,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {39285#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:46,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {39285#(<= ~st1~0 0)} assume ~id2~0 >= 0; {39285#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:46,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {39285#(<= ~st1~0 0)} assume 0 == ~st2~0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {39286#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {39287#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {39288#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:46,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {39289#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:46,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {39290#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {39284#false} is VALID [2022-02-20 19:47:46,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {39284#false} check_#res#1 := check_~tmp~1#1; {39284#false} is VALID [2022-02-20 19:47:46,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {39284#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {39284#false} is VALID [2022-02-20 19:47:46,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {39284#false} assume 0 == assert_~arg#1 % 256; {39284#false} is VALID [2022-02-20 19:47:46,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {39284#false} assume !false; {39284#false} is VALID [2022-02-20 19:47:46,699 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:47:46,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:46,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112311351] [2022-02-20 19:47:46,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112311351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:46,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:46,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:46,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072606809] [2022-02-20 19:47:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:46,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:46,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:46,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:46,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:46,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:46,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:46,773 INFO L87 Difference]: Start difference. First operand 2512 states and 3944 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:53,030 INFO L93 Difference]: Finished difference Result 5032 states and 7940 transitions. [2022-02-20 19:47:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 19:47:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:53,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 2720 transitions. [2022-02-20 19:47:55,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2720 edges. 2720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:55,748 INFO L225 Difference]: With dead ends: 5032 [2022-02-20 19:47:55,748 INFO L226 Difference]: Without dead ends: 4822 [2022-02-20 19:47:55,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:47:55,749 INFO L933 BasicCegarLoop]: 1574 mSDtfsCounter, 10491 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10491 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:55,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10491 Valid, 2765 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:47:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2022-02-20 19:47:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 2720. [2022-02-20 19:47:56,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:56,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4822 states. Second operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have 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:47:56,097 INFO L74 IsIncluded]: Start isIncluded. First operand 4822 states. Second operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have 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:47:56,099 INFO L87 Difference]: Start difference. First operand 4822 states. Second operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have 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:47:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:56,703 INFO L93 Difference]: Finished difference Result 4822 states and 7559 transitions. [2022-02-20 19:47:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 7559 transitions. [2022-02-20 19:47:56,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:56,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:56,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 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 4822 states. [2022-02-20 19:47:56,712 INFO L87 Difference]: Start difference. First operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 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 4822 states. [2022-02-20 19:47:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:57,321 INFO L93 Difference]: Finished difference Result 4822 states and 7559 transitions. [2022-02-20 19:47:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 7559 transitions. [2022-02-20 19:47:57,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:57,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:57,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:57,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2718 states have (on average 1.5702722590139808) internal successors, (4268), 2719 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have 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:47:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4268 transitions. [2022-02-20 19:47:57,530 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4268 transitions. Word has length 77 [2022-02-20 19:47:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:57,531 INFO L470 AbstractCegarLoop]: Abstraction has 2720 states and 4268 transitions. [2022-02-20 19:47:57,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4268 transitions. [2022-02-20 19:47:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:57,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:57,531 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] [2022-02-20 19:47:57,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:47:57,532 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 806369108, now seen corresponding path program 1 times [2022-02-20 19:47:57,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:57,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308444375] [2022-02-20 19:47:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:57,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {57280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {57280#true} is VALID [2022-02-20 19:47:57,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {57280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {57280#true} is VALID [2022-02-20 19:47:57,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {57280#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {57280#true} is VALID [2022-02-20 19:47:57,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {57280#true} assume 0 == ~r1~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st1~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {57282#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {57282#(<= ~r1~0 0)} assume ~id2~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st2~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {57282#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {57282#(<= ~r1~0 0)} assume ~id3~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st3~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {57282#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {57282#(<= ~r1~0 0)} assume ~id4~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {57282#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {57282#(<= ~r1~0 0)} assume ~id5~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {57282#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {57282#(<= ~r1~0 0)} assume ~id6~0 >= 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~st6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {57282#(<= ~r1~0 0)} assume ~send6~0 == ~id6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {57282#(<= ~r1~0 0)} assume 0 == ~mode6~0 % 256; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {57282#(<= ~r1~0 0)} assume ~id1~0 != ~id6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {57282#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {57282#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {57282#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {57282#(<= ~r1~0 0)} assume ~id2~0 != ~id6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {57282#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {57282#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {57282#(<= ~r1~0 0)} assume ~id3~0 != ~id6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {57282#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {57282#(<= ~r1~0 0)} assume ~id4~0 != ~id6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {57282#(<= ~r1~0 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {57282#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {57282#(<= ~r1~0 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {57282#(<= ~r1~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;main1_~i2~0#1 := 0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {57282#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 12);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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {57282#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,604 INFO L290 TraceCheckUtils]: 50: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,604 INFO L290 TraceCheckUtils]: 51: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,604 INFO L290 TraceCheckUtils]: 52: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {57282#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {57282#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {57282#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {57282#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {57282#(<= ~r1~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; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {57282#(<= ~r1~0 0)} assume !(0 != ~mode6~0 % 256); {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,609 INFO L290 TraceCheckUtils]: 69: Hoare triple {57282#(<= ~r1~0 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,609 INFO L290 TraceCheckUtils]: 70: Hoare triple {57282#(<= ~r1~0 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,609 INFO L290 TraceCheckUtils]: 71: Hoare triple {57282#(<= ~r1~0 0)} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {57282#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {57282#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {57282#(<= ~r1~0 0)} assume ~r1~0 >= 6; {57281#false} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {57281#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {57281#false} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 75: Hoare triple {57281#false} check_#res#1 := check_~tmp~1#1; {57281#false} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 76: Hoare triple {57281#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {57281#false} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 77: Hoare triple {57281#false} assume 0 == assert_~arg#1 % 256; {57281#false} is VALID [2022-02-20 19:47:57,610 INFO L290 TraceCheckUtils]: 78: Hoare triple {57281#false} assume !false; {57281#false} is VALID [2022-02-20 19:47:57,611 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:47:57,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:57,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308444375] [2022-02-20 19:47:57,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308444375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:57,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:57,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:57,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712911761] [2022-02-20 19:47:57,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 19:47:57,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:57,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:47:57,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:57,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:57,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:57,656 INFO L87 Difference]: Start difference. First operand 2720 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:47:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:59,620 INFO L93 Difference]: Finished difference Result 3340 states and 5240 transitions. [2022-02-20 19:47:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 19:47:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:47:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:47:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:59,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1761 transitions. [2022-02-20 19:48:00,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1761 edges. 1761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:01,083 INFO L225 Difference]: With dead ends: 3340 [2022-02-20 19:48:01,083 INFO L226 Difference]: Without dead ends: 2922 [2022-02-20 19:48:01,084 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:48:01,084 INFO L933 BasicCegarLoop]: 1585 mSDtfsCounter, 1496 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:01,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 1675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-02-20 19:48:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2022-02-20 19:48:01,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:01,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2922 states. Second operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have 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:48:01,556 INFO L74 IsIncluded]: Start isIncluded. First operand 2922 states. Second operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have 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:48:01,557 INFO L87 Difference]: Start difference. First operand 2922 states. Second operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have 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:48:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:01,769 INFO L93 Difference]: Finished difference Result 2922 states and 4577 transitions. [2022-02-20 19:48:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4577 transitions. [2022-02-20 19:48:01,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:01,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:01,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 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 2922 states. [2022-02-20 19:48:01,776 INFO L87 Difference]: Start difference. First operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 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 2922 states. [2022-02-20 19:48:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:01,985 INFO L93 Difference]: Finished difference Result 2922 states and 4577 transitions. [2022-02-20 19:48:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 4577 transitions. [2022-02-20 19:48:01,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:01,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:01,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:01,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2918 states have (on average 1.5681973954763537) internal successors, (4576), 2919 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have 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:48:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4576 transitions. [2022-02-20 19:48:02,222 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4576 transitions. Word has length 79 [2022-02-20 19:48:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:02,222 INFO L470 AbstractCegarLoop]: Abstraction has 2920 states and 4576 transitions. [2022-02-20 19:48:02,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:48:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4576 transitions. [2022-02-20 19:48:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:48:02,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:02,223 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] [2022-02-20 19:48:02,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:48:02,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 872862620, now seen corresponding path program 1 times [2022-02-20 19:48:02,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:02,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980114528] [2022-02-20 19:48:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:02,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {69707#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~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; {69707#true} is VALID [2022-02-20 19:48:02,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {69707#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {69707#true} is VALID [2022-02-20 19:48:02,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {69707#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {69707#true} is VALID [2022-02-20 19:48:02,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {69707#true} assume 0 == ~r1~0; {69707#true} is VALID [2022-02-20 19:48:02,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {69707#true} assume ~id1~0 >= 0; {69707#true} is VALID [2022-02-20 19:48:02,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {69707#true} assume 0 == ~st1~0; {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {69709#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st2~0; {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send2~0 == ~id2~0; {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode2~0 % 256; {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id3~0 >= 0; {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {69710#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st3~0; {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:02,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~send3~0 == ~id3~0; {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:02,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode3~0 % 256; {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:02,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~id4~0 >= 0; {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:48:02,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {69711#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st4~0; {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {69712#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st5~0; {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send5~0 == ~id5~0; {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode5~0 % 256; {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id6~0 >= 0; {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:48:02,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {69713#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 == ~id6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume 0 == ~mode6~0 % 256; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !!(main1_~i2~0#1 < 12);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; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,510 INFO L290 TraceCheckUtils]: 62: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~r1~0 >= 6); {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:48:02,515 INFO L290 TraceCheckUtils]: 74: Hoare triple {69714#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; {69708#false} is VALID [2022-02-20 19:48:02,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {69708#false} check_#res#1 := check_~tmp~1#1; {69708#false} is VALID [2022-02-20 19:48:02,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {69708#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {69708#false} is VALID [2022-02-20 19:48:02,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {69708#false} assume 0 == assert_~arg#1 % 256; {69708#false} is VALID [2022-02-20 19:48:02,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {69708#false} assume !false; {69708#false} is VALID [2022-02-20 19:48:02,516 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:48:02,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:02,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980114528] [2022-02-20 19:48:02,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980114528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:02,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:02,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:48:02,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314616796] [2022-02-20 19:48:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 19:48:02,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:02,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have 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:48:02,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:02,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:48:02,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:48:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:48:02,578 INFO L87 Difference]: Start difference. First operand 2920 states and 4576 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)