./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:10:14,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:10:14,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:10:14,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:10:14,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:10:14,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:10:14,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:10:14,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:10:14,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:10:14,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:10:14,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:10:14,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:10:14,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:10:14,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:10:14,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:10:14,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:10:14,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:10:14,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:10:14,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:10:14,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:10:14,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:10:14,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:10:14,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:10:14,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:10:14,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:10:14,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:10:14,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:10:14,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:10:14,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:10:14,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:10:14,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:10:14,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:10:14,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:10:14,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:10:14,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:10:14,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:10:14,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:10:14,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:10:14,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:10:14,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:10:14,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:10:14,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:10:14,520 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:10:14,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:10:14,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:10:14,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:10:14,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:10:14,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:10:14,523 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:10:14,523 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:10:14,523 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:10:14,524 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:10:14,524 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:10:14,524 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:10:14,524 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:10:14,525 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:10:14,525 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:10:14,525 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:10:14,526 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:10:14,526 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:10:14,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:10:14,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:10:14,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:10:14,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:10:14,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:10:14,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:10:14,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:10:14,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:10:14,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:10:14,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:10:14,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:10:14,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:10:14,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:10:14,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:10:14,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:14,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:10:14,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:10:14,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:10:14,532 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:10:14,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:10:14,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:10:14,533 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:10:14,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:10:14,533 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P 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 -> Taipan 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2021-11-21 01:10:14,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:10:14,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:10:14,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:10:14,901 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:10:14,903 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:10:14,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-21 01:10:15,012 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/data/1facd8198/b9d5bcf5269b421dba7118effc91ead1/FLAG36b3e9afe [2021-11-21 01:10:15,658 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:10:15,658 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-11-21 01:10:15,670 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/data/1facd8198/b9d5bcf5269b421dba7118effc91ead1/FLAG36b3e9afe [2021-11-21 01:10:16,021 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/data/1facd8198/b9d5bcf5269b421dba7118effc91ead1 [2021-11-21 01:10:16,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:10:16,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:10:16,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:16,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:10:16,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:10:16,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231a2501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16, skipping insertion in model container [2021-11-21 01:10:16,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:10:16,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:10:16,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-21 01:10:16,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:16,503 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:10:16,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2021-11-21 01:10:16,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:10:16,593 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:10:16,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16 WrapperNode [2021-11-21 01:10:16,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:10:16,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:16,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:10:16,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:10:16,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,652 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2021-11-21 01:10:16,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:10:16,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:10:16,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:10:16,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:10:16,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:10:16,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:10:16,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:10:16,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:10:16,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (1/1) ... [2021-11-21 01:10:16,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:10:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:16,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:10:16,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:10:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:10:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-11-21 01:10:16,831 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-11-21 01:10:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-11-21 01:10:16,832 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-11-21 01:10:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-11-21 01:10:16,832 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-11-21 01:10:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-11-21 01:10:16,834 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-11-21 01:10:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:10:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-11-21 01:10:16,834 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-11-21 01:10:16,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:10:16,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:10:16,931 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:10:16,933 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:10:17,445 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:10:17,680 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:10:17,680 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-21 01:10:17,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:17 BoogieIcfgContainer [2021-11-21 01:10:17,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:10:17,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:10:17,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:10:17,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:10:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:10:16" (1/3) ... [2021-11-21 01:10:17,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a61cfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:17, skipping insertion in model container [2021-11-21 01:10:17,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:10:16" (2/3) ... [2021-11-21 01:10:17,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a61cfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:10:17, skipping insertion in model container [2021-11-21 01:10:17,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:17" (3/3) ... [2021-11-21 01:10:17,699 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-11-21 01:10:17,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:10:17,706 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:10:17,778 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:10:17,789 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=FINITE_AUTOMATA, 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 [2021-11-21 01:10:17,790 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:10:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-21 01:10:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 01:10:17,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:17,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:17,826 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:10:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1643096652, now seen corresponding path program 1 times [2021-11-21 01:10:17,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:17,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812843779] [2021-11-21 01:10:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:17,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:10:18,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812843779] [2021-11-21 01:10:18,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812843779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:10:18,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:10:18,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:10:18,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124177818] [2021-11-21 01:10:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:10:18,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 01:10:18,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 01:10:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 01:10:18,306 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 01:10:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:18,404 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2021-11-21 01:10:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 01:10:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 18 [2021-11-21 01:10:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:18,415 INFO L225 Difference]: With dead ends: 68 [2021-11-21 01:10:18,416 INFO L226 Difference]: Without dead ends: 35 [2021-11-21 01:10:18,420 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 [2021-11-21 01:10:18,427 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:18,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:10:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-21 01:10:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-11-21 01:10:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-21 01:10:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-11-21 01:10:18,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2021-11-21 01:10:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:18,477 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-11-21 01:10:18,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 01:10:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-11-21 01:10:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-21 01:10:18,481 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:18,482 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:18,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:10:18,482 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:10:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1599515232, now seen corresponding path program 1 times [2021-11-21 01:10:18,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722908886] [2021-11-21 01:10:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:18,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-21 01:10:18,756 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722908886] [2021-11-21 01:10:18,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722908886] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:10:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263683066] [2021-11-21 01:10:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:18,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:10:18,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:18,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:10:18,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:10:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:18,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:10:18,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-21 01:10:19,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:10:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-21 01:10:21,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263683066] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:10:21,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1979856212] [2021-11-21 01:10:21,260 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-21 01:10:21,260 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:10:21,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:10:21,274 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:10:21,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:10:31,948 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 44 for LOIs [2021-11-21 01:10:32,434 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 107 for LOIs [2021-11-21 01:10:33,589 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 206 for LOIs [2021-11-21 01:10:38,502 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 52 for LOIs [2021-11-21 01:10:38,629 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 111 for LOIs [2021-11-21 01:10:39,050 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:10:44,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 01:10:44,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:10:44,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 9] total 15 [2021-11-21 01:10:44,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804188310] [2021-11-21 01:10:44,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:10:44,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 01:10:44,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:10:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 01:10:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2021-11-21 01:10:44,760 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-21 01:10:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:10:45,170 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2021-11-21 01:10:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:10:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 44 [2021-11-21 01:10:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:10:45,177 INFO L225 Difference]: With dead ends: 73 [2021-11-21 01:10:45,177 INFO L226 Difference]: Without dead ends: 69 [2021-11-21 01:10:45,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2021-11-21 01:10:45,183 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 94 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:10:45,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:10:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-21 01:10:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2021-11-21 01:10:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-11-21 01:10:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2021-11-21 01:10:45,220 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 44 [2021-11-21 01:10:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:10:45,221 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2021-11-21 01:10:45,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 4.5) internal successors, (45), 12 states have internal predecessors, (45), 5 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2021-11-21 01:10:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2021-11-21 01:10:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-21 01:10:45,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:10:45,230 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:10:45,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:10:45,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:10:45,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:10:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:10:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash 525203780, now seen corresponding path program 1 times [2021-11-21 01:10:45,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:10:45,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475995308] [2021-11-21 01:10:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:45,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:10:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-21 01:10:46,296 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:10:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475995308] [2021-11-21 01:10:46,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475995308] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:10:46,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068610046] [2021-11-21 01:10:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:10:46,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:10:46,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:10:46,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:10:46,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:10:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:10:46,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 99 conjunts are in the unsatisfiable core [2021-11-21 01:10:46,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:10:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:10:48,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:11:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-21 01:11:42,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068610046] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:11:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [658330971] [2021-11-21 01:11:42,185 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-21 01:11:42,185 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:11:42,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:11:42,186 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:11:42,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:11:56,701 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 50 for LOIs [2021-11-21 01:11:58,142 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 105 for LOIs [2021-11-21 01:11:58,980 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 195 for LOIs [2021-11-21 01:12:03,425 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 46 for LOIs [2021-11-21 01:12:03,498 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 109 for LOIs [2021-11-21 01:12:03,926 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:12:09,150 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 01:12:09,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:12:09,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2021-11-21 01:12:09,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545053095] [2021-11-21 01:12:09,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:12:09,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-21 01:12:09,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:12:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-21 01:12:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=4720, Unknown=0, NotChecked=0, Total=5112 [2021-11-21 01:12:09,156 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) [2021-11-21 01:12:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:12:37,935 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2021-11-21 01:12:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-21 01:12:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) Word has length 50 [2021-11-21 01:12:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:12:37,941 INFO L225 Difference]: With dead ends: 165 [2021-11-21 01:12:37,942 INFO L226 Difference]: Without dead ends: 161 [2021-11-21 01:12:37,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5098 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=1682, Invalid=13080, Unknown=0, NotChecked=0, Total=14762 [2021-11-21 01:12:37,950 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 408 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:12:37,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 324 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-21 01:12:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-21 01:12:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2021-11-21 01:12:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-21 01:12:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-11-21 01:12:38,000 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 50 [2021-11-21 01:12:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:12:38,000 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-11-21 01:12:38,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) [2021-11-21 01:12:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-11-21 01:12:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-21 01:12:38,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:12:38,004 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:12:38,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:12:38,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:12:38,219 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:12:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:12:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1704345747, now seen corresponding path program 1 times [2021-11-21 01:12:38,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:12:38,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052533537] [2021-11-21 01:12:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:12:38,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:12:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:12:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 01:12:39,731 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:12:39,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052533537] [2021-11-21 01:12:39,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052533537] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:12:39,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312338033] [2021-11-21 01:12:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:12:39,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:12:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:12:39,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:12:39,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 01:12:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:12:39,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 166 conjunts are in the unsatisfiable core [2021-11-21 01:12:39,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:12:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 85 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-21 01:12:45,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:13:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 5 proven. 47 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-21 01:13:56,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312338033] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:13:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [831949956] [2021-11-21 01:13:56,307 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2021-11-21 01:13:56,307 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:13:56,308 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:13:56,308 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:13:56,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:14:29,430 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 50 for LOIs [2021-11-21 01:14:30,882 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 105 for LOIs [2021-11-21 01:14:32,353 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 195 for LOIs [2021-11-21 01:14:40,706 WARN L227 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 344 (called from [L 211] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.xJunctTerm) [2021-11-21 01:14:45,479 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 46 for LOIs [2021-11-21 01:14:45,530 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 109 for LOIs [2021-11-21 01:14:45,947 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:14:58,250 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 01:14:58,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:14:58,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 23] total 80 [2021-11-21 01:14:58,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098756492] [2021-11-21 01:14:58,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:14:58,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-11-21 01:14:58,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:14:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-21 01:14:58,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=10925, Unknown=0, NotChecked=0, Total=11772 [2021-11-21 01:14:58,258 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 80 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 56 states have internal predecessors, (118), 23 states have call successors, (54), 17 states have call predecessors, (54), 26 states have return successors, (54), 23 states have call predecessors, (54), 23 states have call successors, (54) [2021-11-21 01:15:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:15:07,402 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-11-21 01:15:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-21 01:15:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 56 states have internal predecessors, (118), 23 states have call successors, (54), 17 states have call predecessors, (54), 26 states have return successors, (54), 23 states have call predecessors, (54), 23 states have call successors, (54) Word has length 83 [2021-11-21 01:15:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:15:07,404 INFO L225 Difference]: With dead ends: 147 [2021-11-21 01:15:07,404 INFO L226 Difference]: Without dead ends: 0 [2021-11-21 01:15:07,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 167 SyntacticMatches, 9 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6383 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=2126, Invalid=17334, Unknown=0, NotChecked=0, Total=19460 [2021-11-21 01:15:07,413 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 222 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:15:07,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 304 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-21 01:15:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-21 01:15:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-21 01:15:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:15:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-21 01:15:07,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2021-11-21 01:15:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:15:07,416 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-21 01:15:07,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 55 states have (on average 2.1454545454545455) internal successors, (118), 56 states have internal predecessors, (118), 23 states have call successors, (54), 17 states have call predecessors, (54), 26 states have return successors, (54), 23 states have call predecessors, (54), 23 states have call successors, (54) [2021-11-21 01:15:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-21 01:15:07,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-21 01:15:07,419 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:15:07,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:15:07,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:15:07,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-21 01:15:13,324 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 383 398) the Hoare annotation is: (let ((.cse0 (not (= ~b1_val_t~0 1))) (.cse1 (not (= ~z_req_up~0 0))) (.cse2 (= ~d0_ev~0 0)) (.cse3 (not (= ~d0_val_t~0 1))) (.cse4 (not (= ~b0_val_t~0 ~b0_val~0))) (.cse5 (not (= 0 ~b1_req_up~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (= ~d1_val_t~0 ~d1_val~0))) (.cse8 (not (= ~d0_req_up~0 0))) (.cse9 (not (= ~b1_val~0 1))) (.cse10 (not (= ~d1_req_up~0 0))) (.cse11 (not (= ~b0_req_up~0 0))) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (not (= ~d1_val~0 1))) (.cse14 (not (= ~b0_val~0 1)))) (and (or (not (= ~b1_ev~0 2)) (not (= ~d0_val_t~0 ~d0_val~0)) .cse0 .cse1 (not (= ~b0_ev~0 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~b0_ev~0 ~d1_ev~0)) .cse10 .cse11 (= ~d1_ev~0 ~comp_m1_st~0) (= ~d0_ev~0 1) .cse12 .cse13 (not (= ~d1_ev~0 |old(~comp_m1_st~0)|)) .cse14) (or (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (not (= ~d0_val~0 1)) (not (= ~d1_ev~0 1)) (and (not (= 0 |old(~comp_m1_st~0)|)) (not (= 2 |old(~comp_m1_st~0)|))) .cse0 .cse1 (not (= ~b0_ev~0 1)) .cse2 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~z_req_up~0 ~comp_m1_i~0)) .cse12 .cse13 .cse14))) [2021-11-21 01:15:13,324 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2021-11-21 01:15:13,324 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2021-11-21 01:15:13,325 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2021-11-21 01:15:13,325 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 317 349) the Hoare annotation is: (let ((.cse0 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse1 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse2 (not (= ~b1_val_t~0 1))) (.cse3 (not (= ~z_req_up~0 0))) (.cse4 (not (= ~d0_val_t~0 1))) (.cse5 (not (= ~b0_val_t~0 ~b0_val~0))) (.cse6 (not (= 0 ~b1_req_up~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (= ~d1_val_t~0 ~d1_val~0))) (.cse9 (not (= ~d0_req_up~0 0))) (.cse10 (not (= ~b1_val~0 1))) (.cse11 (not (= ~d1_req_up~0 0))) (.cse12 (not (= ~b0_req_up~0 0))) (.cse13 (not (= 0 ~z_val_t~0))) (.cse14 (not (= ~d1_val~0 1))) (.cse15 (not (= ~b0_val~0 1)))) (and (or (and .cse0 (= ~d1_ev~0 ~comp_m1_st~0) (= ~b0_ev~0 2) .cse1) (not (= ~d0_val_t~0 ~d0_val~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~d0_ev~0)| 0) .cse8 .cse9 .cse10 (not (= 2 |old(~b0_ev~0)|)) .cse11 (= |old(~d0_ev~0)| 1) .cse12 (not (= |old(~b1_ev~0)| 2)) (not (= |old(~b0_ev~0)| |old(~d1_ev~0)|)) (not (= ~comp_m1_st~0 |old(~d1_ev~0)|)) .cse13 .cse14 .cse15) (or (not (= ~d0_val~0 1)) (and (= ~d1_ev~0 0) .cse0 (= ~b0_ev~0 0) .cse1) (not (= |old(~b0_ev~0)| 0)) .cse2 .cse3 (not (= |old(~b1_ev~0)| 0)) (and (not (= ~comp_m1_st~0 0)) (not (= 2 ~comp_m1_st~0))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |old(~d1_ev~0)| 0)) .cse11 .cse12 (not (= ~z_req_up~0 ~comp_m1_i~0)) .cse13 .cse14 .cse15))) [2021-11-21 01:15:13,325 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2021-11-21 01:15:13,326 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 208 250) the Hoare annotation is: (let ((.cse48 (= |old(~b1_req_up~0)| 1)) (.cse50 (= |old(~b1_val~0)| 0)) (.cse51 (= |old(~d0_val~0)| 0)) (.cse47 (= |old(~d1_val~0)| 0))) (let ((.cse41 (= 0 ~z_val_t~0)) (.cse18 (not .cse47)) (.cse17 (not .cse51)) (.cse14 (= |old(~d0_req_up~0)| 1)) (.cse20 (not .cse50)) (.cse40 (= |old(~z_req_up~0)| 1)) (.cse21 (not .cse48)) (.cse3 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse4 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse5 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse0 (= ~comp_m1_st~0 0)) (.cse39 (= 2 ~comp_m1_st~0)) (.cse10 (= 1 ~b1_req_up~0)) (.cse7 (= ~d1_val~0 0))) (let ((.cse2 (not (= |old(~z_req_up~0)| 0))) (.cse1 (not (= ~d1_val_t~0 1))) (.cse23 (not (= |old(~d0_req_up~0)| 0))) (.cse13 (not (= ~b1_val_t~0 1))) (.cse15 (not (= |old(~z_val~0)| 0))) (.cse16 (not (= ~d0_val_t~0 1))) (.cse24 (= |old(~d0_ev~0)| 0)) (.cse25 (not (= |old(~b0_val~0)| ~b0_val_t~0))) (.cse26 (not (= 2 |old(~b0_ev~0)|))) (.cse27 (not (= |old(~d0_val~0)| ~d0_val_t~0))) (.cse19 (not (= ~b0_val_t~0 1))) (.cse28 (= |old(~d0_ev~0)| 1)) (.cse29 (not (= 0 |old(~b0_req_up~0)|))) (.cse30 (not (= |old(~b1_ev~0)| 2))) (.cse31 (not (= |old(~b0_ev~0)| |old(~d1_ev~0)|))) (.cse32 (not (= |old(~b1_req_up~0)| 0))) (.cse6 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse35 (let ((.cse45 (not .cse7)) (.cse49 (= ~b0_val_t~0 0))) (let ((.cse44 (or (not .cse10) .cse45 .cse49)) (.cse43 (= |old(~z_val~0)| ~z_val~0)) (.cse46 (or .cse0 .cse39))) (or (let ((.cse42 (= ~b1_val~0 0))) (and .cse41 (or .cse7 (not .cse42)) .cse43 .cse3 .cse4 .cse5 .cse44 (or .cse42 .cse45) .cse46)) (and .cse41 (or (and (or .cse40 (and .cse47 .cse17)) .cse48) (and (or .cse49 .cse10) .cse44) (and (or (and .cse18 (or .cse50 .cse51)) (and .cse47 .cse17 .cse20)) .cse21) (and (or (and .cse47 .cse14 .cse20) .cse40) .cse21) (= ~d1_req_up~0 1)) .cse43 .cse3 .cse4 .cse5 .cse46))))) (.cse36 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse37 (= ~b0_ev~0 2)) (.cse38 (= ~d0_val_t~0 ~d0_val~0)) (.cse8 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse9 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse11 (= |old(~b0_val~0)| ~b0_val~0)) (.cse12 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse22 (not .cse41)) (.cse33 (not (= |old(~d1_req_up~0)| 0))) (.cse34 (not (= ~d1_val_t~0 |old(~d1_val~0)|)))) (and (or (not .cse0) .cse1 .cse2 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse3 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse4 .cse5 .cse6 (= ~z_val~0 0) (= ~d0_val~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 (not .cse14) .cse15 .cse16 (not (= |old(~z_req_up~0)| ~comp_m1_i~0)) .cse17 .cse18 .cse19 (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) .cse20 .cse21 .cse22) (or .cse23 .cse2 .cse13 (not (= |old(~b1_val~0)| 1)) .cse15 .cse16 .cse24 .cse25 .cse26 (not (= |old(~d1_val~0)| 1)) .cse27 .cse28 .cse29 .cse30 .cse31 (not (= ~comp_m1_st~0 |old(~d1_ev~0)|)) .cse32 .cse22 .cse33 .cse34 (and .cse6 (= ~d1_val~0 1) (= ~d1_ev~0 ~comp_m1_st~0) .cse35 .cse36 .cse37 .cse38 .cse8 .cse9 .cse11 .cse12) (not (= |old(~b0_val~0)| 1))) (or .cse1 .cse23 .cse13 .cse15 .cse16 .cse24 .cse25 (not .cse39) .cse26 .cse27 .cse19 .cse28 .cse29 .cse30 .cse31 .cse32 (not (= ~b1_val_t~0 |old(~b1_val~0)|)) (and (= ~b0_ev~0 ~d1_ev~0) (= ~d1_val_t~0 ~d1_val~0) .cse6 .cse35 .cse36 .cse37 .cse38 .cse8 .cse9 .cse11 .cse12) (not .cse40) .cse22 .cse33 .cse34))))) [2021-11-21 01:15:13,326 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2021-11-21 01:15:13,327 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 350 382) the Hoare annotation is: (let ((.cse2 (not (= ~b1_val_t~0 1))) (.cse3 (not (= ~z_req_up~0 0))) (.cse4 (not (= ~d0_val_t~0 1))) (.cse5 (not (= ~b0_val_t~0 ~b0_val~0))) (.cse6 (not (= 0 ~b1_req_up~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (= |old(~d0_ev~0)| 0)) (.cse9 (not (= ~d1_val_t~0 ~d1_val~0))) (.cse10 (not (= ~d0_req_up~0 0))) (.cse11 (not (= ~b1_val~0 1))) (.cse0 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse1 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse12 (not (= ~d1_req_up~0 0))) (.cse13 (not (= ~b0_req_up~0 0))) (.cse14 (not (= 0 ~z_val_t~0))) (.cse15 (not (= ~d1_val~0 1))) (.cse16 (not (= ~b0_val~0 1)))) (and (or (and .cse0 (= ~d1_ev~0 ~comp_m1_st~0) (= ~b0_ev~0 2) .cse1) (not (= ~d0_val_t~0 ~d0_val~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 2 |old(~b0_ev~0)|)) .cse12 (= |old(~d0_ev~0)| 1) .cse13 (not (= |old(~b1_ev~0)| 2)) (not (= |old(~b0_ev~0)| |old(~d1_ev~0)|)) (not (= ~comp_m1_st~0 |old(~d1_ev~0)|)) .cse14 .cse15 .cse16) (or (not (= ~d0_val~0 1)) (not (= ~comp_m1_st~0 0)) (not (= |old(~b1_ev~0)| 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and (= ~b0_ev~0 |old(~b0_ev~0)|) .cse0 (= ~d1_ev~0 1) .cse1) .cse12 .cse13 (not (= |old(~b0_ev~0)| 1)) (not (= ~z_req_up~0 ~comp_m1_i~0)) .cse14 .cse15 (not (= |old(~d1_ev~0)| 1)) .cse16))) [2021-11-21 01:15:13,327 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2021-11-21 01:15:13,327 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse21 (= 2 ~comp_m1_st~0))) (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse2 (= 0 |ULTIMATE.start_method1_~s1~0#1|)) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (= ~b0_ev~0 ~d1_ev~0)) (.cse5 (not (= ~d0_ev~0 0))) (.cse6 (= 0 ~b1_req_up~0)) (.cse7 (= ~b1_ev~0 2)) (.cse8 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~d1_val_t~0 ~d1_val~0)) (.cse11 (= ~z_val~0 0)) (.cse12 (= 0 |ULTIMATE.start_method1_~s2~0#1|)) (.cse13 (= 1 |ULTIMATE.start_method1_~s3~0#1|)) (.cse14 (= ~b0_ev~0 2)) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse16 (= ~b1_val_t~0 1)) (.cse17 (= ~d0_val_t~0 1)) (.cse18 (or (= ~comp_m1_st~0 0) .cse21)) (.cse19 (= ~b0_val_t~0 ~b0_val~0)) (.cse20 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 (= ~z_req_up~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~d1_val~0 1) (= ~b0_val~0 1) .cse11 (= ~d1_ev~0 ~comp_m1_st~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~b1_val~0 1) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d1_val_t~0 1) .cse5 .cse6 (= ~b0_val_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 (= ~z_req_up~0 1) .cse13 .cse14 .cse15 (= ~b1_val~0 ~b1_val_t~0) .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-11-21 01:15:13,327 INFO L858 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2021-11-21 01:15:13,328 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: false [2021-11-21 01:15:13,328 INFO L854 garLoopResultBuilder]: At program point L432-1(lines 429 454) the Hoare annotation is: (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse2 (= ~z_req_up~0 0)) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (= ~b0_ev~0 ~d1_ev~0)) (.cse5 (not (= ~d0_ev~0 0))) (.cse6 (= 0 ~b1_req_up~0)) (.cse7 (= ~b1_ev~0 2)) (.cse8 (= ~d1_req_up~0 0)) (.cse9 (= ~d1_val_t~0 ~d1_val~0)) (.cse10 (= ~d1_val~0 1)) (.cse11 (= ~b0_val~0 1)) (.cse12 (= ~z_val~0 0)) (.cse13 (= ~b0_ev~0 2)) (.cse14 (= ~d0_val_t~0 ~d0_val~0)) (.cse15 (= ~b1_val_t~0 1)) (.cse16 (= ~d0_val_t~0 1)) (.cse17 (= ~b1_val~0 1)) (.cse18 (= ~b0_val_t~0 ~b0_val~0)) (.cse19 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~z_req_up~0 ~comp_m1_i~0) .cse17 .cse18 .cse19) (and .cse0 .cse1 (= 0 |ULTIMATE.start_method1_~s1~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-21 01:15:13,328 INFO L858 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2021-11-21 01:15:13,328 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-21 01:15:13,329 INFO L854 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (or (and (or (not (= |old(~b1_ev~0)| 1)) (and (or (and (= ~b0_ev~0 ~d1_ev~0) (or (and (not (= ~d0_ev~0 1)) (= |old(~d0_ev~0)| ~d0_ev~0)) (= 2 ~d0_ev~0))) (not (= |old(~d1_ev~0)| 1))) (= ~b1_ev~0 2))) (= ~b0_ev~0 2)) (not (= |old(~b0_ev~0)| 1))) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= ~d1_val_t~0 1) (= ~b1_val~0 0) (= ~b0_val_t~0 1) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~z_val~0 0) (= ~d0_val~0 0) (= ~d1_val~0 0) (= ~b1_val_t~0 1) (= ~d1_req_up~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= 1 ~b1_req_up~0)) [2021-11-21 01:15:13,329 INFO L854 garLoopResultBuilder]: At program point L425-1(line 425) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= 0 ~b1_req_up~0) (= ~b1_ev~0 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_ev~0 0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (= ~b0_ev~0 0) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,329 INFO L854 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse2 (= ~comp_m1_st~0 0)) (.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse21 (= 0 |ULTIMATE.start_method1_~s1~0#1|)) (.cse3 (= ~z_req_up~0 0)) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (= ~b0_ev~0 ~d1_ev~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse7 (= 0 ~b1_req_up~0)) (.cse8 (= ~b1_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~d1_val_t~0 ~d1_val~0)) (.cse11 (= ~d1_val~0 1)) (.cse12 (= ~b0_val~0 1)) (.cse13 (= ~z_val~0 0)) (.cse22 (= 0 |ULTIMATE.start_method1_~s2~0#1|)) (.cse23 (= 1 |ULTIMATE.start_method1_~s3~0#1|)) (.cse14 (= ~b0_ev~0 2)) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse16 (= ~b1_val_t~0 1)) (.cse17 (= ~d0_val_t~0 1)) (.cse18 (= ~b1_val~0 1)) (.cse19 (= ~b0_val_t~0 ~b0_val~0)) (.cse20 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~z_req_up~0 ~comp_m1_i~0) .cse18 .cse19 .cse20) (let ((.cse24 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0))) (and .cse1 .cse4 .cse5 (= ~d1_val_t~0 1) .cse6 .cse7 (or .cse3 (and .cse21 .cse22 .cse23)) (= ~b0_val_t~0 1) .cse8 .cse9 .cse10 .cse13 (or (= |ULTIMATE.start_eval_~tmp___0~0#1| 1) .cse24) (or (and (= ~z_val~0 ~z_val_t~0) .cse2 .cse3) (and .cse0 (= 2 ~comp_m1_st~0) (= ~z_req_up~0 1))) .cse14 .cse15 (= ~b1_val~0 ~b1_val_t~0) .cse16 .cse17 (or (not .cse2) (not .cse24)) .cse19 .cse20)) (and .cse0 .cse1 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 ~comp_m1_st~0) .cse22 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-21 01:15:13,330 INFO L854 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse21 (= 2 ~comp_m1_st~0))) (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse2 (= 0 |ULTIMATE.start_method1_~s1~0#1|)) (.cse3 (not (= ~d0_ev~0 1))) (.cse4 (= ~b0_ev~0 ~d1_ev~0)) (.cse5 (not (= ~d0_ev~0 0))) (.cse6 (= 0 ~b1_req_up~0)) (.cse7 (= ~b1_ev~0 2)) (.cse8 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~d1_val_t~0 ~d1_val~0)) (.cse11 (= ~z_val~0 0)) (.cse12 (= 0 |ULTIMATE.start_method1_~s2~0#1|)) (.cse13 (= 1 |ULTIMATE.start_method1_~s3~0#1|)) (.cse14 (= ~b0_ev~0 2)) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse16 (= ~b1_val_t~0 1)) (.cse17 (= ~d0_val_t~0 1)) (.cse18 (or (= ~comp_m1_st~0 0) .cse21)) (.cse19 (= ~b0_val_t~0 ~b0_val~0)) (.cse20 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 (= ~z_req_up~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~d1_val~0 1) (= ~b0_val~0 1) .cse11 (= ~d1_ev~0 ~comp_m1_st~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~b1_val~0 1) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d1_val_t~0 1) .cse5 .cse6 (= ~b0_val_t~0 1) .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 (= ~z_req_up~0 1) .cse13 .cse14 .cse15 (= ~b1_val~0 ~b1_val_t~0) .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-11-21 01:15:13,330 INFO L858 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2021-11-21 01:15:13,330 INFO L861 garLoopResultBuilder]: At program point L501-2(lines 501 507) the Hoare annotation is: true [2021-11-21 01:15:13,330 INFO L854 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~z_req_up~0 0) (= 0 ~b1_req_up~0) (= ~b1_ev~0 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_ev~0 0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0)) (= ~b0_ev~0 0) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,331 INFO L854 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~z_req_up~0 0) (= ~b0_ev~0 1) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 1) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~d1_ev~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0)) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,331 INFO L854 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse2 (= ~comp_m1_st~0 0)) (.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse21 (= 0 |ULTIMATE.start_method1_~s1~0#1|)) (.cse3 (= ~z_req_up~0 0)) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (= ~b0_ev~0 ~d1_ev~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse7 (= 0 ~b1_req_up~0)) (.cse8 (= ~b1_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~d1_val_t~0 ~d1_val~0)) (.cse11 (= ~d1_val~0 1)) (.cse12 (= ~b0_val~0 1)) (.cse13 (= ~z_val~0 0)) (.cse22 (= 0 |ULTIMATE.start_method1_~s2~0#1|)) (.cse23 (= 1 |ULTIMATE.start_method1_~s3~0#1|)) (.cse14 (= ~b0_ev~0 2)) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse16 (= ~b1_val_t~0 1)) (.cse17 (= ~d0_val_t~0 1)) (.cse18 (= ~b1_val~0 1)) (.cse19 (= ~b0_val_t~0 ~b0_val~0)) (.cse20 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~z_req_up~0 ~comp_m1_i~0) .cse18 .cse19 .cse20) (let ((.cse24 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0))) (and .cse1 .cse4 .cse5 (= ~d1_val_t~0 1) .cse6 .cse7 (or .cse3 (and .cse21 .cse22 .cse23)) (= ~b0_val_t~0 1) .cse8 .cse9 .cse10 .cse13 (or (= |ULTIMATE.start_eval_~tmp___0~0#1| 1) .cse24) (or (and (= ~z_val~0 ~z_val_t~0) .cse2 .cse3) (and .cse0 (= 2 ~comp_m1_st~0) (= ~z_req_up~0 1))) .cse14 .cse15 (= ~b1_val~0 ~b1_val_t~0) .cse16 .cse17 (or (not .cse2) (not .cse24)) .cse19 .cse20)) (and .cse0 .cse1 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~d1_ev~0 ~comp_m1_st~0) .cse22 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-21 01:15:13,331 INFO L854 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= 0 |ULTIMATE.start_method1_~s1~0#1|) (= ~z_req_up~0 0) (not (= ~d0_ev~0 1)) (= ~b0_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 2) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) (= ~b0_ev~0 2) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,332 INFO L854 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= 0 |ULTIMATE.start_method1_~s1~0#1|) (= ~z_req_up~0 0) (not (= ~d0_ev~0 1)) (= ~b0_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 2) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) (= ~b0_ev~0 2) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,332 INFO L854 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= ~b0_ev~0 1) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 1) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~d1_ev~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,332 INFO L858 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2021-11-21 01:15:13,332 INFO L854 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= 0 |ULTIMATE.start_method1_~s1~0#1|) (= ~z_req_up~0 0) (not (= ~d0_ev~0 1)) (= ~b0_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 2) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) (= ~b0_ev~0 2) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,333 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-21 01:15:13,333 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-21 01:15:13,333 INFO L858 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2021-11-21 01:15:13,333 INFO L854 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= 0 |ULTIMATE.start_method1_~s1~0#1|) (= ~z_req_up~0 0) (not (= ~d0_ev~0 1)) (= ~b0_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 2) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) (= ~b0_ev~0 2) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,334 INFO L854 garLoopResultBuilder]: At program point L405-1(line 405) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= 0 |ULTIMATE.start_method1_~s1~0#1|) (= ~z_req_up~0 0) (not (= ~d0_ev~0 1)) (= ~b0_ev~0 ~d1_ev~0) (not (= ~d0_ev~0 0)) (= 0 ~b1_req_up~0) (= ~b1_ev~0 2) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d1_ev~0 ~comp_m1_st~0) (= 0 |ULTIMATE.start_method1_~s2~0#1|) (= 1 |ULTIMATE.start_method1_~s3~0#1|) (= ~b0_ev~0 2) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2021-11-21 01:15:13,334 INFO L854 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 0))) (or (and (= 0 ~z_val_t~0) .cse0 (or (= |ULTIMATE.start_eval_~tmp___0~0#1| 1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0))) (and (= ~z_req_up~0 0) .cse0 (= ~z_req_up~0 ~comp_m1_i~0)))) [2021-11-21 01:15:13,334 INFO L854 garLoopResultBuilder]: At program point L290(lines 290 294) the Hoare annotation is: (let ((.cse1 (= ~b0_req_up~0 0)) (.cse4 (not (= ~d0_ev~0 1))) (.cse5 (= ~b0_ev~0 ~d1_ev~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse7 (= 0 ~b1_req_up~0)) (.cse8 (= ~b1_ev~0 2)) (.cse10 (= ~d1_req_up~0 0)) (.cse11 (= ~d1_val_t~0 ~d1_val~0)) (.cse12 (= ~z_val~0 0)) (.cse15 (= ~b0_ev~0 2)) (.cse16 (= ~d0_val_t~0 ~d0_val~0)) (.cse17 (= ~b1_val_t~0 1)) (.cse3 (= ~z_req_up~0 0)) (.cse2 (= 0 |ULTIMATE.start_method1_~s1~0#1|)) (.cse13 (= 0 |ULTIMATE.start_method1_~s2~0#1|)) (.cse14 (= 1 |ULTIMATE.start_method1_~s3~0#1|)) (.cse18 (= ~d0_val_t~0 1)) (.cse9 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse0 (= 0 ~z_val_t~0)) (.cse19 (= ~b0_val_t~0 ~b0_val~0)) (.cse20 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~d1_val~0 1) (= ~b0_val~0 1) .cse12 (= ~d1_ev~0 ~comp_m1_st~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~b1_val~0 1) .cse19 .cse20) (let ((.cse21 (= ~comp_m1_st~0 0))) (and .cse1 .cse4 .cse5 (= ~d1_val_t~0 1) .cse6 .cse7 (= ~b0_val_t~0 1) .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 (= ~b1_val~0 ~b1_val_t~0) .cse17 (or (and (= |ULTIMATE.start_eval_~tmp___0~0#1| 1) .cse3) (and .cse2 .cse9 .cse13 .cse14)) .cse18 (or (not .cse21) (not .cse9)) (or (and (= ~z_val~0 ~z_val_t~0) .cse21) (and .cse0 (= 2 ~comp_m1_st~0) (= ~z_req_up~0 1))) .cse19 .cse20)))) [2021-11-21 01:15:13,337 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-11-21 01:15:13,339 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:15:13,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:15:13 BoogieIcfgContainer [2021-11-21 01:15:13,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:15:13,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:15:13,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:15:13,404 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:15:13,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:10:17" (3/4) ... [2021-11-21 01:15:13,421 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-21 01:15:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-11-21 01:15:13,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-11-21 01:15:13,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-11-21 01:15:13,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-11-21 01:15:13,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-11-21 01:15:13,440 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-11-21 01:15:13,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2021-11-21 01:15:13,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-21 01:15:13,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-21 01:15:13,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(comp_m1_st == 0) || !(d1_val_t == 1)) || !(\old(z_req_up) == 0)) || (((((((((((((d1_ev == \old(d1_ev) && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && \old(d0_ev) == d0_ev) && z_val == 0) && d0_val == 0) && d1_val == 0) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && 1 == b1_req_up) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(b1_val_t == 1)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || !(\old(z_req_up) == comp_m1_i)) || !(\old(d0_val) == 0)) || !(\old(d1_val) == 0)) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_val) == 0)) || !(\old(b1_req_up) == 1)) || !(0 == z_val_t)) && (((((((((((((((((((((!(\old(d0_req_up) == 0) || !(\old(z_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(b1_val) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || \old(d0_ev) == 0) || !(\old(b0_val) == b0_val_t)) || !(2 == \old(b0_ev))) || !(\old(d1_val) == 1)) || !(\old(d0_val) == d0_val_t)) || \old(d0_ev) == 1) || !(0 == \old(b0_req_up))) || !(\old(b1_ev) == 2)) || !(\old(b0_ev) == \old(d1_ev))) || !(comp_m1_st == \old(d1_ev))) || !(\old(b1_req_up) == 0)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || ((((((((((\old(d0_ev) == d0_ev && d1_val == 1) && d1_ev == comp_m1_st) && (((((((((0 == z_val_t && (d1_val == 0 || !(b1_val == 0))) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0)) && (b1_val == 0 || !(d1_val == 0))) && (comp_m1_st == 0 || 2 == comp_m1_st)) || ((((((0 == z_val_t && ((((((\old(z_req_up) == 1 || (\old(d1_val) == 0 && !(\old(d0_val) == 0))) && \old(b1_req_up) == 1) || ((b0_val_t == 0 || 1 == b1_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0))) || (((!(\old(d1_val) == 0) && (\old(b1_val) == 0 || \old(d0_val) == 0)) || ((\old(d1_val) == 0 && !(\old(d0_val) == 0)) && !(\old(b1_val) == 0))) && !(\old(b1_req_up) == 1))) || ((((\old(d1_val) == 0 && \old(d0_req_up) == 1) && !(\old(b1_val) == 0)) || \old(z_req_up) == 1) && !(\old(b1_req_up) == 1))) || d1_req_up == 1)) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && (comp_m1_st == 0 || 2 == comp_m1_st)))) && \old(b1_req_up) == b1_req_up) && b0_ev == 2) && d0_val_t == d0_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(\old(b0_val) == 1))) && (((((((((((((((((((((!(d1_val_t == 1) || !(\old(d0_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || \old(d0_ev) == 0) || !(\old(b0_val) == b0_val_t)) || !(2 == comp_m1_st)) || !(2 == \old(b0_ev))) || !(\old(d0_val) == d0_val_t)) || !(b0_val_t == 1)) || \old(d0_ev) == 1) || !(0 == \old(b0_req_up))) || !(\old(b1_ev) == 2)) || !(\old(b0_ev) == \old(d1_ev))) || !(\old(b1_req_up) == 0)) || !(b1_val_t == \old(b1_val))) || ((((((((((b0_ev == d1_ev && d1_val_t == d1_val) && \old(d0_ev) == d0_ev) && (((((((((0 == z_val_t && (d1_val == 0 || !(b1_val == 0))) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0)) && (b1_val == 0 || !(d1_val == 0))) && (comp_m1_st == 0 || 2 == comp_m1_st)) || ((((((0 == z_val_t && ((((((\old(z_req_up) == 1 || (\old(d1_val) == 0 && !(\old(d0_val) == 0))) && \old(b1_req_up) == 1) || ((b0_val_t == 0 || 1 == b1_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0))) || (((!(\old(d1_val) == 0) && (\old(b1_val) == 0 || \old(d0_val) == 0)) || ((\old(d1_val) == 0 && !(\old(d0_val) == 0)) && !(\old(b1_val) == 0))) && !(\old(b1_req_up) == 1))) || ((((\old(d1_val) == 0 && \old(d0_req_up) == 1) && !(\old(b1_val) == 0)) || \old(z_req_up) == 1) && !(\old(b1_req_up) == 1))) || d1_req_up == 1)) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && (comp_m1_st == 0 || 2 == comp_m1_st)))) && \old(b1_req_up) == b1_req_up) && b0_ev == 2) && d0_val_t == d0_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(\old(z_req_up) == 1)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) [2021-11-21 01:15:13,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(b1_ev == 2) || !(d0_val_t == d0_val)) || !(b1_val_t == 1)) || !(z_req_up == 0)) || !(b0_ev == 2)) || d0_ev == 0) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(b0_ev == d1_ev)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || d1_ev == comp_m1_st) || d0_ev == 1) || !(0 == z_val_t)) || !(d1_val == 1)) || !(d1_ev == \old(comp_m1_st))) || !(b0_val == 1)) && (((((((((((((((((((((comp_m1_st == \old(comp_m1_st) || !(d0_val == 1)) || !(d1_ev == 1)) || (!(0 == \old(comp_m1_st)) && !(2 == \old(comp_m1_st)))) || !(b1_val_t == 1)) || !(z_req_up == 0)) || !(b0_ev == 1)) || d0_ev == 0) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(b1_ev == 1)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || !(z_req_up == comp_m1_i)) || !(0 == z_val_t)) || !(d1_val == 1)) || !(b0_val == 1)) [2021-11-21 01:15:13,557 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 01:15:13,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:15:13,558 INFO L158 Benchmark]: Toolchain (without parser) took 297530.75ms. Allocated memory was 102.8MB in the beginning and 708.8MB in the end (delta: 606.1MB). Free memory was 68.9MB in the beginning and 378.9MB in the end (delta: -310.0MB). Peak memory consumption was 296.7MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,559 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 73.4MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:15:13,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 77.5MB in the end (delta: -8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.90ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,560 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 73.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,560 INFO L158 Benchmark]: RCFGBuilder took 993.87ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 43.7MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,561 INFO L158 Benchmark]: TraceAbstraction took 295713.44ms. Allocated memory was 102.8MB in the beginning and 708.8MB in the end (delta: 606.1MB). Free memory was 43.3MB in the beginning and 387.3MB in the end (delta: -344.0MB). Peak memory consumption was 404.1MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,561 INFO L158 Benchmark]: Witness Printer took 153.94ms. Allocated memory is still 708.8MB. Free memory was 387.3MB in the beginning and 378.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 01:15:13,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 73.4MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 102.8MB. Free memory was 68.7MB in the beginning and 77.5MB in the end (delta: -8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.90ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 73.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 993.87ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 43.7MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 295713.44ms. Allocated memory was 102.8MB in the beginning and 708.8MB in the end (delta: 606.1MB). Free memory was 43.3MB in the beginning and 387.3MB in the end (delta: -344.0MB). Peak memory consumption was 404.1MB. Max. memory is 16.1GB. * Witness Printer took 153.94ms. Allocated memory is still 708.8MB. Free memory was 387.3MB in the beginning and 378.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 295.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 724 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 827 mSDsCounter, 1591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3074 IncrementalHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1591 mSolverCounterUnsat, 116 mSDtfsCounter, 3074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 364 SyntacticMatches, 14 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12252 ImplicationChecksByTransitivity, 72.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=3, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 59 PreInvPairs, 82 NumberOfFragments, 3197 HoareAnnotationTreeSize, 59 FomulaSimplifications, 1399 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 13154 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 137.0s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 31441 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 132/351 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((0 == z_val_t && z_val == 0) && (tmp___0 == 1 || tmp___0 == 0)) && (comp_m1_st == 0 || 2 == comp_m1_st)) || ((z_req_up == 0 && z_val == 0) && z_req_up == comp_m1_i) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((((((((b0_req_up == 0 && !(d0_ev == 1)) && b0_ev == d1_ev) && d1_val_t == 1) && !(d0_ev == 0)) && 0 == b1_req_up) && (z_req_up == 0 || ((0 == s1 && 0 == s2) && 1 == s3))) && b0_val_t == 1) && b1_ev == 2) && d1_req_up == 0) && d1_val_t == d1_val) && z_val == 0) && (tmp___0 == 1 || tmp___0 == 0)) && (((z_val == z_val_t && comp_m1_st == 0) && z_req_up == 0) || ((0 == z_val_t && 2 == comp_m1_st) && z_req_up == 1))) && b0_ev == 2) && d0_val_t == d0_val) && b1_val == b1_val_t) && b1_val_t == 1) && d0_val_t == 1) && (!(comp_m1_st == 0) || !(tmp___0 == 0))) && b0_val_t == b0_val) && d0_req_up == 0)) || (((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d1_ev == comp_m1_st) && 0 == s2) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) || ((((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d1_ev == comp_m1_st) && 0 == s2) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d1_ev == comp_m1_st) && 0 == s2) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) || ((((((((((((((((((((b0_req_up == 0 && !(d0_ev == 1)) && b0_ev == d1_ev) && d1_val_t == 1) && !(d0_ev == 0)) && 0 == b1_req_up) && b0_val_t == 1) && b1_ev == 2) && d1_req_up == 0) && d1_val_t == d1_val) && z_val == 0) && b0_ev == 2) && d0_val_t == d0_val) && b1_val == b1_val_t) && b1_val_t == 1) && ((tmp___0 == 1 && z_req_up == 0) || (((0 == s1 && tmp___0 == 0) && 0 == s2) && 1 == s3))) && d0_val_t == 1) && (!(comp_m1_st == 0) || !(tmp___0 == 0))) && ((z_val == z_val_t && comp_m1_st == 0) || ((0 == z_val_t && 2 == comp_m1_st) && z_req_up == 1))) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d1_ev == comp_m1_st) && 0 == s2) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0 - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && 0 == b1_req_up) && b1_ev == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_ev == 0) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_ev == 0) && b0_val_t == b0_val) && d0_req_up == 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(b1_ev == 2) || !(d0_val_t == d0_val)) || !(b1_val_t == 1)) || !(z_req_up == 0)) || !(b0_ev == 2)) || d0_ev == 0) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(b0_ev == d1_ev)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || d1_ev == comp_m1_st) || d0_ev == 1) || !(0 == z_val_t)) || !(d1_val == 1)) || !(d1_ev == \old(comp_m1_st))) || !(b0_val == 1)) && (((((((((((((((((((((comp_m1_st == \old(comp_m1_st) || !(d0_val == 1)) || !(d1_ev == 1)) || (!(0 == \old(comp_m1_st)) && !(2 == \old(comp_m1_st)))) || !(b1_val_t == 1)) || !(z_req_up == 0)) || !(b0_ev == 1)) || d0_ev == 0) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(b1_ev == 1)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || !(z_req_up == comp_m1_i)) || !(0 == z_val_t)) || !(d1_val == 1)) || !(b0_val == 1)) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && z_req_up == 0) && !(d0_ev == 1)) && b0_ev == d1_ev) && !(d0_ev == 0)) && 0 == b1_req_up) && b1_ev == 2) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d1_ev == comp_m1_st) && 0 == s2) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == s1) && !(d0_ev == 1)) && b0_ev == d1_ev) && d1_val_t == 1) && !(d0_ev == 0)) && 0 == b1_req_up) && b0_val_t == 1) && b1_ev == 2) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && 2 == comp_m1_st) && z_val == 0) && 0 == s2) && z_req_up == 1) && 1 == s3) && b0_ev == 2) && d0_val_t == d0_val) && b1_val == b1_val_t) && b1_val_t == 1) && d0_val_t == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(comp_m1_st == 0) || !(d1_val_t == 1)) || !(\old(z_req_up) == 0)) || (((((((((((((d1_ev == \old(d1_ev) && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && \old(d0_ev) == d0_ev) && z_val == 0) && d0_val == 0) && d1_val == 0) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && 1 == b1_req_up) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(b1_val_t == 1)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || !(\old(z_req_up) == comp_m1_i)) || !(\old(d0_val) == 0)) || !(\old(d1_val) == 0)) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_val) == 0)) || !(\old(b1_req_up) == 1)) || !(0 == z_val_t)) && (((((((((((((((((((((!(\old(d0_req_up) == 0) || !(\old(z_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(b1_val) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || \old(d0_ev) == 0) || !(\old(b0_val) == b0_val_t)) || !(2 == \old(b0_ev))) || !(\old(d1_val) == 1)) || !(\old(d0_val) == d0_val_t)) || \old(d0_ev) == 1) || !(0 == \old(b0_req_up))) || !(\old(b1_ev) == 2)) || !(\old(b0_ev) == \old(d1_ev))) || !(comp_m1_st == \old(d1_ev))) || !(\old(b1_req_up) == 0)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || ((((((((((\old(d0_ev) == d0_ev && d1_val == 1) && d1_ev == comp_m1_st) && (((((((((0 == z_val_t && (d1_val == 0 || !(b1_val == 0))) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0)) && (b1_val == 0 || !(d1_val == 0))) && (comp_m1_st == 0 || 2 == comp_m1_st)) || ((((((0 == z_val_t && ((((((\old(z_req_up) == 1 || (\old(d1_val) == 0 && !(\old(d0_val) == 0))) && \old(b1_req_up) == 1) || ((b0_val_t == 0 || 1 == b1_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0))) || (((!(\old(d1_val) == 0) && (\old(b1_val) == 0 || \old(d0_val) == 0)) || ((\old(d1_val) == 0 && !(\old(d0_val) == 0)) && !(\old(b1_val) == 0))) && !(\old(b1_req_up) == 1))) || ((((\old(d1_val) == 0 && \old(d0_req_up) == 1) && !(\old(b1_val) == 0)) || \old(z_req_up) == 1) && !(\old(b1_req_up) == 1))) || d1_req_up == 1)) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && (comp_m1_st == 0 || 2 == comp_m1_st)))) && \old(b1_req_up) == b1_req_up) && b0_ev == 2) && d0_val_t == d0_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(\old(b0_val) == 1))) && (((((((((((((((((((((!(d1_val_t == 1) || !(\old(d0_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || \old(d0_ev) == 0) || !(\old(b0_val) == b0_val_t)) || !(2 == comp_m1_st)) || !(2 == \old(b0_ev))) || !(\old(d0_val) == d0_val_t)) || !(b0_val_t == 1)) || \old(d0_ev) == 1) || !(0 == \old(b0_req_up))) || !(\old(b1_ev) == 2)) || !(\old(b0_ev) == \old(d1_ev))) || !(\old(b1_req_up) == 0)) || !(b1_val_t == \old(b1_val))) || ((((((((((b0_ev == d1_ev && d1_val_t == d1_val) && \old(d0_ev) == d0_ev) && (((((((((0 == z_val_t && (d1_val == 0 || !(b1_val == 0))) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0)) && (b1_val == 0 || !(d1_val == 0))) && (comp_m1_st == 0 || 2 == comp_m1_st)) || ((((((0 == z_val_t && ((((((\old(z_req_up) == 1 || (\old(d1_val) == 0 && !(\old(d0_val) == 0))) && \old(b1_req_up) == 1) || ((b0_val_t == 0 || 1 == b1_req_up) && ((!(1 == b1_req_up) || !(d1_val == 0)) || b0_val_t == 0))) || (((!(\old(d1_val) == 0) && (\old(b1_val) == 0 || \old(d0_val) == 0)) || ((\old(d1_val) == 0 && !(\old(d0_val) == 0)) && !(\old(b1_val) == 0))) && !(\old(b1_req_up) == 1))) || ((((\old(d1_val) == 0 && \old(d0_req_up) == 1) && !(\old(b1_val) == 0)) || \old(z_req_up) == 1) && !(\old(b1_req_up) == 1))) || d1_req_up == 1)) && \old(z_val) == z_val) && b0_req_up == \old(b0_req_up)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && (comp_m1_st == 0 || 2 == comp_m1_st)))) && \old(b1_req_up) == b1_req_up) && b0_ev == 2) && d0_val_t == d0_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) || !(\old(z_req_up) == 1)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-21 01:15:13,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3815b315-5e3c-4f2b-9e48-f93e065faf8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE