./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e27a879cb97b2b6600a7b4379c4e090f4fa709a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:33:53,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:33:53,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:33:53,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:33:53,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:33:53,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:33:53,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:33:53,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:33:53,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:33:53,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:33:53,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:33:53,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:33:53,768 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:33:53,768 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:33:53,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:33:53,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:33:53,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:33:53,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:33:53,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:33:53,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:33:53,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:33:53,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:33:53,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:33:53,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:33:53,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:33:53,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:33:53,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:33:53,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:33:53,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:33:53,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:33:53,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:33:53,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:33:53,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:33:53,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:33:53,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:33:53,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:33:53,783 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:33:53,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:33:53,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:33:53,793 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:33:53,794 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:33:53,794 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:33:53,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:33:53,794 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:33:53,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:33:53,794 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:33:53,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:33:53,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:33:53,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:33:53,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:33:53,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:33:53,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:33:53,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:33:53,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:33:53,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:33:53,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:33:53,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:33:53,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:33:53,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:33:53,798 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:33:53,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:33:53,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:33:53,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:33:53,799 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan 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(__VERIFIER_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 -> 5e27a879cb97b2b6600a7b4379c4e090f4fa709a [2018-12-02 14:33:53,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:33:53,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:33:53,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:33:53,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:33:53,829 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:33:53,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-02 14:33:53,865 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/data/c3979ecb4/4715cfce899d4c6ebfcca54e7bb556e6/FLAG1fa127ec9 [2018-12-02 14:33:54,217 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:33:54,217 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/sv-benchmarks/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-02 14:33:54,222 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/data/c3979ecb4/4715cfce899d4c6ebfcca54e7bb556e6/FLAG1fa127ec9 [2018-12-02 14:33:54,604 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/data/c3979ecb4/4715cfce899d4c6ebfcca54e7bb556e6 [2018-12-02 14:33:54,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:33:54,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:33:54,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:33:54,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:33:54,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:33:54,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54, skipping insertion in model container [2018-12-02 14:33:54,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:33:54,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:33:54,751 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:33:54,754 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:33:54,782 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:33:54,822 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:33:54,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54 WrapperNode [2018-12-02 14:33:54,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:33:54,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:33:54,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:33:54,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:33:54,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:33:54,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:33:54,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:33:54,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:33:54,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... [2018-12-02 14:33:54,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:33:54,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:33:54,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:33:54,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:33:54,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:33:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-02 14:33:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-02 14:33:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-12-02 14:33:54,909 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-12-02 14:33:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-02 14:33:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-02 14:33:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-02 14:33:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-02 14:33:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-02 14:33:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-02 14:33:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-02 14:33:54,913 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-02 14:33:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:33:54,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:33:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-02 14:33:54,913 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-02 14:33:55,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:33:55,227 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 14:33:55,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:33:55 BoogieIcfgContainer [2018-12-02 14:33:55,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:33:55,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:33:55,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:33:55,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:33:55,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:33:54" (1/3) ... [2018-12-02 14:33:55,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16678090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:33:55, skipping insertion in model container [2018-12-02 14:33:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:33:54" (2/3) ... [2018-12-02 14:33:55,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16678090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:33:55, skipping insertion in model container [2018-12-02 14:33:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:33:55" (3/3) ... [2018-12-02 14:33:55,233 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-02 14:33:55,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:33:55,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:33:55,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:33:55,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:33:55,278 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:33:55,278 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:33:55,278 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:33:55,278 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:33:55,278 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:33:55,278 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:33:55,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:33:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2018-12-02 14:33:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:55,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:55,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:55,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:55,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2007921434, now seen corresponding path program 1 times [2018-12-02 14:33:55,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:55,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:55,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:55,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:33:55,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:55,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:33:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:33:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:33:55,501 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 4 states. [2018-12-02 14:33:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:55,629 INFO L93 Difference]: Finished difference Result 464 states and 690 transitions. [2018-12-02 14:33:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:33:55,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 14:33:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:55,638 INFO L225 Difference]: With dead ends: 464 [2018-12-02 14:33:55,638 INFO L226 Difference]: Without dead ends: 232 [2018-12-02 14:33:55,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:33:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-12-02 14:33:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-12-02 14:33:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2018-12-02 14:33:55,679 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 120 [2018-12-02 14:33:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:55,680 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2018-12-02 14:33:55,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:33:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2018-12-02 14:33:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:55,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:55,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:55,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:55,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:55,683 INFO L82 PathProgramCache]: Analyzing trace with hash 25472612, now seen corresponding path program 1 times [2018-12-02 14:33:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:55,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:55,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:55,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:55,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:55,770 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand 5 states. [2018-12-02 14:33:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:56,085 INFO L93 Difference]: Finished difference Result 480 states and 694 transitions. [2018-12-02 14:33:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:56,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:56,088 INFO L225 Difference]: With dead ends: 480 [2018-12-02 14:33:56,088 INFO L226 Difference]: Without dead ends: 270 [2018-12-02 14:33:56,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-02 14:33:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 232. [2018-12-02 14:33:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 325 transitions. [2018-12-02 14:33:56,103 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 325 transitions. Word has length 120 [2018-12-02 14:33:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:56,103 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 325 transitions. [2018-12-02 14:33:56,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 325 transitions. [2018-12-02 14:33:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:56,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:56,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:56,104 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1031258590, now seen corresponding path program 1 times [2018-12-02 14:33:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:56,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:56,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:56,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:56,164 INFO L87 Difference]: Start difference. First operand 232 states and 325 transitions. Second operand 5 states. [2018-12-02 14:33:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:56,460 INFO L93 Difference]: Finished difference Result 478 states and 689 transitions. [2018-12-02 14:33:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:56,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:56,462 INFO L225 Difference]: With dead ends: 478 [2018-12-02 14:33:56,462 INFO L226 Difference]: Without dead ends: 268 [2018-12-02 14:33:56,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-02 14:33:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2018-12-02 14:33:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2018-12-02 14:33:56,482 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 120 [2018-12-02 14:33:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:56,482 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2018-12-02 14:33:56,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2018-12-02 14:33:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:56,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:56,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:56,484 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:56,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1644733792, now seen corresponding path program 1 times [2018-12-02 14:33:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:56,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:56,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:56,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:56,555 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 5 states. [2018-12-02 14:33:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:56,832 INFO L93 Difference]: Finished difference Result 476 states and 683 transitions. [2018-12-02 14:33:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:56,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:56,834 INFO L225 Difference]: With dead ends: 476 [2018-12-02 14:33:56,835 INFO L226 Difference]: Without dead ends: 266 [2018-12-02 14:33:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-02 14:33:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 232. [2018-12-02 14:33:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2018-12-02 14:33:56,852 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 120 [2018-12-02 14:33:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:56,853 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2018-12-02 14:33:56,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2018-12-02 14:33:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:56,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:56,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:56,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:56,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 761224802, now seen corresponding path program 1 times [2018-12-02 14:33:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:56,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:56,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:56,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:56,906 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand 5 states. [2018-12-02 14:33:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:57,167 INFO L93 Difference]: Finished difference Result 474 states and 677 transitions. [2018-12-02 14:33:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:57,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:57,169 INFO L225 Difference]: With dead ends: 474 [2018-12-02 14:33:57,169 INFO L226 Difference]: Without dead ends: 264 [2018-12-02 14:33:57,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-02 14:33:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2018-12-02 14:33:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 322 transitions. [2018-12-02 14:33:57,187 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 322 transitions. Word has length 120 [2018-12-02 14:33:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:57,187 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 322 transitions. [2018-12-02 14:33:57,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 322 transitions. [2018-12-02 14:33:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:57,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:57,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:57,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:57,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 732724512, now seen corresponding path program 1 times [2018-12-02 14:33:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:57,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:57,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:57,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:57,256 INFO L87 Difference]: Start difference. First operand 232 states and 322 transitions. Second operand 5 states. [2018-12-02 14:33:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:57,574 INFO L93 Difference]: Finished difference Result 497 states and 715 transitions. [2018-12-02 14:33:57,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:57,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:57,576 INFO L225 Difference]: With dead ends: 497 [2018-12-02 14:33:57,576 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 14:33:57,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 14:33:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 232. [2018-12-02 14:33:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2018-12-02 14:33:57,587 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 120 [2018-12-02 14:33:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:57,587 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2018-12-02 14:33:57,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2018-12-02 14:33:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:57,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:57,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:57,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:57,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:57,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1207857502, now seen corresponding path program 1 times [2018-12-02 14:33:57,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:57,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:57,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:57,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:57,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:57,627 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand 5 states. [2018-12-02 14:33:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:57,847 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2018-12-02 14:33:57,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:57,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:57,848 INFO L225 Difference]: With dead ends: 491 [2018-12-02 14:33:57,848 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 14:33:57,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 14:33:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 232. [2018-12-02 14:33:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 320 transitions. [2018-12-02 14:33:57,866 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 320 transitions. Word has length 120 [2018-12-02 14:33:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:57,867 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 320 transitions. [2018-12-02 14:33:57,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 320 transitions. [2018-12-02 14:33:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:57,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:57,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:57,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 669205728, now seen corresponding path program 1 times [2018-12-02 14:33:57,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:57,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:57,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:57,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:57,925 INFO L87 Difference]: Start difference. First operand 232 states and 320 transitions. Second operand 5 states. [2018-12-02 14:33:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:58,187 INFO L93 Difference]: Finished difference Result 493 states and 703 transitions. [2018-12-02 14:33:58,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:58,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:58,189 INFO L225 Difference]: With dead ends: 493 [2018-12-02 14:33:58,189 INFO L226 Difference]: Without dead ends: 283 [2018-12-02 14:33:58,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-02 14:33:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2018-12-02 14:33:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2018-12-02 14:33:58,201 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 120 [2018-12-02 14:33:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:58,201 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2018-12-02 14:33:58,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2018-12-02 14:33:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:58,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:58,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:58,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:58,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash -101527838, now seen corresponding path program 1 times [2018-12-02 14:33:58,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:58,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:58,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:58,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:33:58,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:58,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:33:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:33:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:33:58,242 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand 5 states. [2018-12-02 14:33:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:58,506 INFO L93 Difference]: Finished difference Result 491 states and 697 transitions. [2018-12-02 14:33:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:33:58,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-12-02 14:33:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:58,508 INFO L225 Difference]: With dead ends: 491 [2018-12-02 14:33:58,508 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 14:33:58,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:33:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 14:33:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 232. [2018-12-02 14:33:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 14:33:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 318 transitions. [2018-12-02 14:33:58,522 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 318 transitions. Word has length 120 [2018-12-02 14:33:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:58,522 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 318 transitions. [2018-12-02 14:33:58,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:33:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 318 transitions. [2018-12-02 14:33:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 14:33:58,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:58,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:58,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:58,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1096221536, now seen corresponding path program 1 times [2018-12-02 14:33:58,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:58,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:33:58,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:33:58,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:33:58,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:58,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:33:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:33:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:33:58,581 INFO L87 Difference]: Start difference. First operand 232 states and 318 transitions. Second operand 4 states. [2018-12-02 14:33:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:33:58,772 INFO L93 Difference]: Finished difference Result 636 states and 906 transitions. [2018-12-02 14:33:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:33:58,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 14:33:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:33:58,773 INFO L225 Difference]: With dead ends: 636 [2018-12-02 14:33:58,774 INFO L226 Difference]: Without dead ends: 427 [2018-12-02 14:33:58,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:33:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-12-02 14:33:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 426. [2018-12-02 14:33:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-02 14:33:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 581 transitions. [2018-12-02 14:33:58,799 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 581 transitions. Word has length 120 [2018-12-02 14:33:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:33:58,800 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 581 transitions. [2018-12-02 14:33:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:33:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 581 transitions. [2018-12-02 14:33:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 14:33:58,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:33:58,801 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:33:58,801 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:33:58,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1962486696, now seen corresponding path program 1 times [2018-12-02 14:33:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:33:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:33:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:33:58,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:33:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:33:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 14:33:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:33:58,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:33:58,858 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-02 14:33:58,860 INFO L205 CegarAbsIntRunner]: [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [222], [224], [226], [227], [289], [292], [295], [303], [304], [305], [307], [310], [315], [320], [323], [326], [331], [336], [339], [342], [346], [348], [349], [352], [376], [377], [380], [386], [392], [400], [404], [410], [416], [422], [428], [434], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [599], [612], [625], [638], [644], [647], [650], [658], [659], [660], [674], [676], [706], [710], [711], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:33:58,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:33:58,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:33:59,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:33:59,042 INFO L272 AbstractInterpreter]: Visited 47 different actions 47 times. Never merged. Never widened. Performed 605 root evaluator evaluations with a maximum evaluation depth of 3. Performed 605 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:33:59,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:33:59,046 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:33:59,191 INFO L227 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 65.75% of their original sizes. [2018-12-02 14:33:59,191 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:33:59,286 INFO L418 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-12-02 14:33:59,286 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:33:59,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:33:59,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-12-02 14:33:59,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:33:59,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 14:33:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 14:33:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:33:59,287 INFO L87 Difference]: Start difference. First operand 426 states and 581 transitions. Second operand 13 states. [2018-12-02 14:34:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:01,300 INFO L93 Difference]: Finished difference Result 979 states and 1359 transitions. [2018-12-02 14:34:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:34:01,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 195 [2018-12-02 14:34:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:01,302 INFO L225 Difference]: With dead ends: 979 [2018-12-02 14:34:01,302 INFO L226 Difference]: Without dead ends: 568 [2018-12-02 14:34:01,303 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-12-02 14:34:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-02 14:34:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2018-12-02 14:34:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-02 14:34:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 732 transitions. [2018-12-02 14:34:01,337 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 732 transitions. Word has length 195 [2018-12-02 14:34:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:01,337 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 732 transitions. [2018-12-02 14:34:01,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 14:34:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 732 transitions. [2018-12-02 14:34:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-02 14:34:01,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:01,338 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:01,339 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:01,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1724607356, now seen corresponding path program 1 times [2018-12-02 14:34:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:01,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 14:34:01,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:01,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:34:01,397 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-12-02 14:34:01,398 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [331], [336], [339], [342], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [593], [599], [612], [625], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:34:01,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:34:01,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:34:01,435 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:34:01,436 INFO L272 AbstractInterpreter]: Visited 66 different actions 66 times. Never merged. Never widened. Performed 744 root evaluator evaluations with a maximum evaluation depth of 3. Performed 744 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:34:01,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:01,437 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:34:01,519 INFO L227 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 65.06% of their original sizes. [2018-12-02 14:34:01,519 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:34:01,743 INFO L418 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-12-02 14:34:01,743 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:34:01,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:34:01,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-12-02 14:34:01,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:01,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 14:34:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 14:34:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:34:01,744 INFO L87 Difference]: Start difference. First operand 556 states and 732 transitions. Second operand 21 states. [2018-12-02 14:34:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:04,590 INFO L93 Difference]: Finished difference Result 1100 states and 1459 transitions. [2018-12-02 14:34:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 14:34:04,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 216 [2018-12-02 14:34:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:04,592 INFO L225 Difference]: With dead ends: 1100 [2018-12-02 14:34:04,592 INFO L226 Difference]: Without dead ends: 567 [2018-12-02 14:34:04,594 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 14:34:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-02 14:34:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2018-12-02 14:34:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-02 14:34:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 727 transitions. [2018-12-02 14:34:04,658 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 727 transitions. Word has length 216 [2018-12-02 14:34:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:04,658 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 727 transitions. [2018-12-02 14:34:04,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 14:34:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 727 transitions. [2018-12-02 14:34:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 14:34:04,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:04,661 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:04,661 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:04,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 100124084, now seen corresponding path program 1 times [2018-12-02 14:34:04,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:04,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:04,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 14:34:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:04,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:34:04,725 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-12-02 14:34:04,726 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [612], [625], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:34:04,728 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:34:04,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:34:04,757 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:34:04,757 INFO L272 AbstractInterpreter]: Visited 87 different actions 87 times. Never merged. Never widened. Performed 883 root evaluator evaluations with a maximum evaluation depth of 3. Performed 883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:34:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:04,761 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:34:04,822 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 64.02% of their original sizes. [2018-12-02 14:34:04,822 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:34:05,202 INFO L418 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-12-02 14:34:05,203 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:34:05,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:34:05,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [6] total 33 [2018-12-02 14:34:05,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:05,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 14:34:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 14:34:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-12-02 14:34:05,204 INFO L87 Difference]: Start difference. First operand 555 states and 727 transitions. Second operand 29 states. [2018-12-02 14:34:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:10,206 INFO L93 Difference]: Finished difference Result 1099 states and 1446 transitions. [2018-12-02 14:34:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 14:34:10,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 217 [2018-12-02 14:34:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:10,208 INFO L225 Difference]: With dead ends: 1099 [2018-12-02 14:34:10,208 INFO L226 Difference]: Without dead ends: 567 [2018-12-02 14:34:10,210 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 240 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=2291, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 14:34:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-02 14:34:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2018-12-02 14:34:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-02 14:34:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 724 transitions. [2018-12-02 14:34:10,248 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 724 transitions. Word has length 217 [2018-12-02 14:34:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:10,248 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 724 transitions. [2018-12-02 14:34:10,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 14:34:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 724 transitions. [2018-12-02 14:34:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 14:34:10,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:10,249 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:10,249 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:10,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash 759613568, now seen corresponding path program 1 times [2018-12-02 14:34:10,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:10,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 14:34:10,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:34:10,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:34:10,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:34:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:34:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:34:10,337 INFO L87 Difference]: Start difference. First operand 555 states and 724 transitions. Second operand 6 states. [2018-12-02 14:34:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:10,396 INFO L93 Difference]: Finished difference Result 976 states and 1335 transitions. [2018-12-02 14:34:10,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:34:10,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2018-12-02 14:34:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:10,399 INFO L225 Difference]: With dead ends: 976 [2018-12-02 14:34:10,399 INFO L226 Difference]: Without dead ends: 574 [2018-12-02 14:34:10,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:34:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-02 14:34:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 560. [2018-12-02 14:34:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-02 14:34:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 728 transitions. [2018-12-02 14:34:10,444 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 728 transitions. Word has length 195 [2018-12-02 14:34:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:10,444 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 728 transitions. [2018-12-02 14:34:10,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:34:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 728 transitions. [2018-12-02 14:34:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 14:34:10,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:10,445 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:10,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:10,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 767110260, now seen corresponding path program 1 times [2018-12-02 14:34:10,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-02 14:34:10,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:34:10,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:34:10,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:10,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:34:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:34:10,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:34:10,509 INFO L87 Difference]: Start difference. First operand 560 states and 728 transitions. Second operand 4 states. [2018-12-02 14:34:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:10,679 INFO L93 Difference]: Finished difference Result 1362 states and 1888 transitions. [2018-12-02 14:34:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:34:10,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-12-02 14:34:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:10,683 INFO L225 Difference]: With dead ends: 1362 [2018-12-02 14:34:10,683 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 14:34:10,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:34:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 14:34:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 947. [2018-12-02 14:34:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-02 14:34:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1255 transitions. [2018-12-02 14:34:10,735 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1255 transitions. Word has length 217 [2018-12-02 14:34:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:10,735 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1255 transitions. [2018-12-02 14:34:10,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:34:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1255 transitions. [2018-12-02 14:34:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 14:34:10,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:10,737 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:10,737 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:10,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1097979764, now seen corresponding path program 1 times [2018-12-02 14:34:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:10,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-02 14:34:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:34:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:34:10,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:10,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:34:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:34:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:34:10,783 INFO L87 Difference]: Start difference. First operand 947 states and 1255 transitions. Second operand 4 states. [2018-12-02 14:34:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:11,020 INFO L93 Difference]: Finished difference Result 2511 states and 3519 transitions. [2018-12-02 14:34:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:34:11,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-12-02 14:34:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:11,025 INFO L225 Difference]: With dead ends: 2511 [2018-12-02 14:34:11,025 INFO L226 Difference]: Without dead ends: 1717 [2018-12-02 14:34:11,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:34:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-12-02 14:34:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1705. [2018-12-02 14:34:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2018-12-02 14:34:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2287 transitions. [2018-12-02 14:34:11,150 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2287 transitions. Word has length 218 [2018-12-02 14:34:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:11,151 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2287 transitions. [2018-12-02 14:34:11,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:34:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2287 transitions. [2018-12-02 14:34:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 14:34:11,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:11,153 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:11,153 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:11,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -596079597, now seen corresponding path program 1 times [2018-12-02 14:34:11,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:11,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 14:34:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:34:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:34:11,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:11,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:34:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:34:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:34:11,210 INFO L87 Difference]: Start difference. First operand 1705 states and 2287 transitions. Second operand 6 states. [2018-12-02 14:34:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:11,325 INFO L93 Difference]: Finished difference Result 3309 states and 4597 transitions. [2018-12-02 14:34:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:34:11,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-12-02 14:34:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:11,329 INFO L225 Difference]: With dead ends: 3309 [2018-12-02 14:34:11,329 INFO L226 Difference]: Without dead ends: 1757 [2018-12-02 14:34:11,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:34:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2018-12-02 14:34:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1725. [2018-12-02 14:34:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2018-12-02 14:34:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2303 transitions. [2018-12-02 14:34:11,416 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2303 transitions. Word has length 219 [2018-12-02 14:34:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:11,417 INFO L480 AbstractCegarLoop]: Abstraction has 1725 states and 2303 transitions. [2018-12-02 14:34:11,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:34:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2303 transitions. [2018-12-02 14:34:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 14:34:11,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:11,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:11,419 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:11,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1966808188, now seen corresponding path program 1 times [2018-12-02 14:34:11,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:11,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:11,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 14:34:11,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:11,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:34:11,454 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-02 14:34:11,454 INFO L205 CegarAbsIntRunner]: [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [599], [612], [625], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:34:11,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:34:11,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:34:11,505 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:34:11,505 INFO L272 AbstractInterpreter]: Visited 131 different actions 181 times. Never merged. Never widened. Performed 1622 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:34:11,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:11,510 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:34:11,623 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 75.02% of their original sizes. [2018-12-02 14:34:11,623 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:34:13,317 INFO L418 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-12-02 14:34:13,317 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:34:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:34:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [4] total 76 [2018-12-02 14:34:13,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-02 14:34:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-02 14:34:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=4752, Unknown=0, NotChecked=0, Total=5402 [2018-12-02 14:34:13,319 INFO L87 Difference]: Start difference. First operand 1725 states and 2303 transitions. Second operand 74 states. [2018-12-02 14:34:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:30,521 INFO L93 Difference]: Finished difference Result 4001 states and 5419 transitions. [2018-12-02 14:34:30,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-02 14:34:30,521 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 195 [2018-12-02 14:34:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:30,527 INFO L225 Difference]: With dead ends: 4001 [2018-12-02 14:34:30,527 INFO L226 Difference]: Without dead ends: 2300 [2018-12-02 14:34:30,534 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 303 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2996, Invalid=30310, Unknown=0, NotChecked=0, Total=33306 [2018-12-02 14:34:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2018-12-02 14:34:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2250. [2018-12-02 14:34:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2018-12-02 14:34:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 2973 transitions. [2018-12-02 14:34:30,653 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 2973 transitions. Word has length 195 [2018-12-02 14:34:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:30,653 INFO L480 AbstractCegarLoop]: Abstraction has 2250 states and 2973 transitions. [2018-12-02 14:34:30,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-02 14:34:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2973 transitions. [2018-12-02 14:34:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-02 14:34:30,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:30,656 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:30,656 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:30,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1621378051, now seen corresponding path program 1 times [2018-12-02 14:34:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:30,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 14:34:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:34:30,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:34:30,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:30,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:34:30,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:34:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:34:30,718 INFO L87 Difference]: Start difference. First operand 2250 states and 2973 transitions. Second operand 5 states. [2018-12-02 14:34:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:31,375 INFO L93 Difference]: Finished difference Result 5530 states and 7592 transitions. [2018-12-02 14:34:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:34:31,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2018-12-02 14:34:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:31,382 INFO L225 Difference]: With dead ends: 5530 [2018-12-02 14:34:31,382 INFO L226 Difference]: Without dead ends: 3638 [2018-12-02 14:34:31,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:34:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2018-12-02 14:34:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3545. [2018-12-02 14:34:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3545 states. [2018-12-02 14:34:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4734 transitions. [2018-12-02 14:34:31,555 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4734 transitions. Word has length 202 [2018-12-02 14:34:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:31,555 INFO L480 AbstractCegarLoop]: Abstraction has 3545 states and 4734 transitions. [2018-12-02 14:34:31,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:34:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4734 transitions. [2018-12-02 14:34:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-02 14:34:31,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:31,559 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:31,559 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:31,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2026170032, now seen corresponding path program 1 times [2018-12-02 14:34:31,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:31,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-02 14:34:31,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:31,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:34:31,619 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-12-02 14:34:31,620 INFO L205 CegarAbsIntRunner]: [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [596], [603], [609], [616], [619], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:34:31,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:34:31,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:34:31,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:34:31,672 INFO L272 AbstractInterpreter]: Visited 148 different actions 200 times. Never merged. Never widened. Performed 1784 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1784 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:34:31,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:31,674 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:34:31,809 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.21% of their original sizes. [2018-12-02 14:34:31,809 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:34:33,689 INFO L418 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2018-12-02 14:34:33,690 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:34:33,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:34:33,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [5] total 79 [2018-12-02 14:34:33,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:33,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-02 14:34:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-02 14:34:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=5176, Unknown=0, NotChecked=0, Total=5700 [2018-12-02 14:34:33,694 INFO L87 Difference]: Start difference. First operand 3545 states and 4734 transitions. Second operand 76 states. [2018-12-02 14:34:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:34:52,052 INFO L93 Difference]: Finished difference Result 5849 states and 8048 transitions. [2018-12-02 14:34:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-02 14:34:52,052 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 266 [2018-12-02 14:34:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:34:52,064 INFO L225 Difference]: With dead ends: 5849 [2018-12-02 14:34:52,064 INFO L226 Difference]: Without dead ends: 4017 [2018-12-02 14:34:52,072 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8500 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2070, Invalid=24012, Unknown=0, NotChecked=0, Total=26082 [2018-12-02 14:34:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2018-12-02 14:34:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 3912. [2018-12-02 14:34:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2018-12-02 14:34:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5240 transitions. [2018-12-02 14:34:52,271 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5240 transitions. Word has length 266 [2018-12-02 14:34:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:34:52,272 INFO L480 AbstractCegarLoop]: Abstraction has 3912 states and 5240 transitions. [2018-12-02 14:34:52,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-02 14:34:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5240 transitions. [2018-12-02 14:34:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-02 14:34:52,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:34:52,275 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:34:52,275 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:34:52,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1080744594, now seen corresponding path program 1 times [2018-12-02 14:34:52,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:34:52,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:52,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:34:52,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:34:52,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:34:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:34:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:34:52,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:34:52,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:34:52,335 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-12-02 14:34:52,336 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [612], [625], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:34:52,337 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:34:52,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:34:52,382 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:34:52,382 INFO L272 AbstractInterpreter]: Visited 142 different actions 195 times. Never merged. Never widened. Performed 1700 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1700 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:34:52,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:34:52,385 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:34:52,496 INFO L227 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 72.52% of their original sizes. [2018-12-02 14:34:52,497 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:34:53,808 INFO L418 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2018-12-02 14:34:53,808 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:34:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:34:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [5] total 76 [2018-12-02 14:34:53,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:34:53,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-02 14:34:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-02 14:34:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=4746, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 14:34:53,810 INFO L87 Difference]: Start difference. First operand 3912 states and 5240 transitions. Second operand 73 states. [2018-12-02 14:35:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:18,884 INFO L93 Difference]: Finished difference Result 6994 states and 9506 transitions. [2018-12-02 14:35:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-02 14:35:18,884 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 264 [2018-12-02 14:35:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:18,892 INFO L225 Difference]: With dead ends: 6994 [2018-12-02 14:35:18,892 INFO L226 Difference]: Without dead ends: 4404 [2018-12-02 14:35:18,897 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 368 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10738 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2266, Invalid=29240, Unknown=0, NotChecked=0, Total=31506 [2018-12-02 14:35:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2018-12-02 14:35:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 4284. [2018-12-02 14:35:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4284 states. [2018-12-02 14:35:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 5721 transitions. [2018-12-02 14:35:19,107 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 5721 transitions. Word has length 264 [2018-12-02 14:35:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:35:19,108 INFO L480 AbstractCegarLoop]: Abstraction has 4284 states and 5721 transitions. [2018-12-02 14:35:19,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-02 14:35:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 5721 transitions. [2018-12-02 14:35:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-02 14:35:19,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:19,111 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:19,111 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:19,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash -674642897, now seen corresponding path program 1 times [2018-12-02 14:35:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:19,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:35:19,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:35:19,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:35:19,183 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-12-02 14:35:19,183 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [603], [609], [616], [622], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:35:19,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:35:19,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:35:19,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:35:19,250 INFO L272 AbstractInterpreter]: Visited 149 different actions 202 times. Never merged. Never widened. Performed 1786 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1786 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:35:19,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:19,251 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:35:19,364 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 72.93% of their original sizes. [2018-12-02 14:35:19,364 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:35:21,454 INFO L418 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2018-12-02 14:35:21,454 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:35:21,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:35:21,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [5] total 79 [2018-12-02 14:35:21,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:21,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-02 14:35:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-02 14:35:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=5178, Unknown=0, NotChecked=0, Total=5700 [2018-12-02 14:35:21,455 INFO L87 Difference]: Start difference. First operand 4284 states and 5721 transitions. Second operand 76 states. [2018-12-02 14:35:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:38,855 INFO L93 Difference]: Finished difference Result 5349 states and 7214 transitions. [2018-12-02 14:35:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-02 14:35:38,855 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 266 [2018-12-02 14:35:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:38,863 INFO L225 Difference]: With dead ends: 5349 [2018-12-02 14:35:38,863 INFO L226 Difference]: Without dead ends: 4410 [2018-12-02 14:35:38,865 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11014 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2278, Invalid=30302, Unknown=0, NotChecked=0, Total=32580 [2018-12-02 14:35:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2018-12-02 14:35:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4302. [2018-12-02 14:35:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4302 states. [2018-12-02 14:35:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5751 transitions. [2018-12-02 14:35:39,071 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5751 transitions. Word has length 266 [2018-12-02 14:35:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:35:39,072 INFO L480 AbstractCegarLoop]: Abstraction has 4302 states and 5751 transitions. [2018-12-02 14:35:39,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-02 14:35:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5751 transitions. [2018-12-02 14:35:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 14:35:39,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:39,075 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:39,075 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:39,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1400917170, now seen corresponding path program 1 times [2018-12-02 14:35:39,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:39,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:35:39,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:35:39,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:35:39,132 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-02 14:35:39,132 INFO L205 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [596], [603], [606], [625], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:35:39,133 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:35:39,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:35:39,180 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:35:39,180 INFO L272 AbstractInterpreter]: Visited 145 different actions 199 times. Never merged. Never widened. Performed 1716 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1716 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:35:39,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:39,185 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:35:39,297 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 71.93% of their original sizes. [2018-12-02 14:35:39,297 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:35:41,566 INFO L418 sIntCurrentIteration]: We unified 264 AI predicates to 264 [2018-12-02 14:35:41,566 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:35:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:35:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [5] total 76 [2018-12-02 14:35:41,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:41,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-02 14:35:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-02 14:35:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=4773, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 14:35:41,567 INFO L87 Difference]: Start difference. First operand 4302 states and 5751 transitions. Second operand 73 states. [2018-12-02 14:36:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:05,285 INFO L93 Difference]: Finished difference Result 7735 states and 10479 transitions. [2018-12-02 14:36:05,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-02 14:36:05,285 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 265 [2018-12-02 14:36:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:05,295 INFO L225 Difference]: With dead ends: 7735 [2018-12-02 14:36:05,296 INFO L226 Difference]: Without dead ends: 4755 [2018-12-02 14:36:05,302 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8239 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1974, Invalid=23148, Unknown=0, NotChecked=0, Total=25122 [2018-12-02 14:36:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2018-12-02 14:36:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4656. [2018-12-02 14:36:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2018-12-02 14:36:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 6212 transitions. [2018-12-02 14:36:05,553 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 6212 transitions. Word has length 265 [2018-12-02 14:36:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:05,553 INFO L480 AbstractCegarLoop]: Abstraction has 4656 states and 6212 transitions. [2018-12-02 14:36:05,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-02 14:36:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 6212 transitions. [2018-12-02 14:36:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-02 14:36:05,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:05,557 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:05,557 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:05,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash -287257133, now seen corresponding path program 1 times [2018-12-02 14:36:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:05,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:05,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:05,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:36:05,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:36:05,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:36:05,617 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-12-02 14:36:05,617 INFO L205 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [596], [603], [606], [616], [622], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:36:05,618 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:36:05,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:36:05,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:36:05,665 INFO L272 AbstractInterpreter]: Visited 150 different actions 204 times. Never merged. Never widened. Performed 1792 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:36:05,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:05,669 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:36:05,782 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 72.25% of their original sizes. [2018-12-02 14:36:05,782 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:36:07,088 INFO L418 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2018-12-02 14:36:07,088 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:36:07,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:36:07,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [5] total 78 [2018-12-02 14:36:07,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:07,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-02 14:36:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-02 14:36:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=5060, Unknown=0, NotChecked=0, Total=5550 [2018-12-02 14:36:07,090 INFO L87 Difference]: Start difference. First operand 4656 states and 6212 transitions. Second operand 75 states. [2018-12-02 14:36:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:24,995 INFO L93 Difference]: Finished difference Result 5722 states and 7694 transitions. [2018-12-02 14:36:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-02 14:36:24,995 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 266 [2018-12-02 14:36:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:25,002 INFO L225 Difference]: With dead ends: 5722 [2018-12-02 14:36:25,003 INFO L226 Difference]: Without dead ends: 4771 [2018-12-02 14:36:25,005 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8419 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1981, Invalid=23779, Unknown=0, NotChecked=0, Total=25760 [2018-12-02 14:36:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2018-12-02 14:36:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4666. [2018-12-02 14:36:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2018-12-02 14:36:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 6228 transitions. [2018-12-02 14:36:25,236 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 6228 transitions. Word has length 266 [2018-12-02 14:36:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:25,236 INFO L480 AbstractCegarLoop]: Abstraction has 4666 states and 6228 transitions. [2018-12-02 14:36:25,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-02 14:36:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 6228 transitions. [2018-12-02 14:36:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-02 14:36:25,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:25,240 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:25,240 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:25,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1628869453, now seen corresponding path program 1 times [2018-12-02 14:36:25,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:25,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 14:36:25,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:36:25,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:36:25,330 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-12-02 14:36:25,331 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [603], [606], [625], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:36:25,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:36:25,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:36:25,378 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:36:25,378 INFO L272 AbstractInterpreter]: Visited 152 different actions 207 times. Never merged. Never widened. Performed 1780 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1780 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:36:25,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:25,380 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:36:25,492 INFO L227 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 71.96% of their original sizes. [2018-12-02 14:36:25,492 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:36:26,763 INFO L418 sIntCurrentIteration]: We unified 270 AI predicates to 270 [2018-12-02 14:36:26,763 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:36:26,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:36:26,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [5] total 78 [2018-12-02 14:36:26,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:26,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-02 14:36:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-02 14:36:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=5062, Unknown=0, NotChecked=0, Total=5550 [2018-12-02 14:36:26,764 INFO L87 Difference]: Start difference. First operand 4666 states and 6228 transitions. Second operand 75 states. [2018-12-02 14:36:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:44,275 INFO L93 Difference]: Finished difference Result 6762 states and 9088 transitions. [2018-12-02 14:36:44,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-02 14:36:44,275 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 271 [2018-12-02 14:36:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:44,284 INFO L225 Difference]: With dead ends: 6762 [2018-12-02 14:36:44,284 INFO L226 Difference]: Without dead ends: 5457 [2018-12-02 14:36:44,288 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 375 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11038 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2217, Invalid=30003, Unknown=0, NotChecked=0, Total=32220 [2018-12-02 14:36:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2018-12-02 14:36:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5322. [2018-12-02 14:36:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5322 states. [2018-12-02 14:36:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5322 states to 5322 states and 7066 transitions. [2018-12-02 14:36:44,597 INFO L78 Accepts]: Start accepts. Automaton has 5322 states and 7066 transitions. Word has length 271 [2018-12-02 14:36:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:44,597 INFO L480 AbstractCegarLoop]: Abstraction has 5322 states and 7066 transitions. [2018-12-02 14:36:44,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-02 14:36:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 7066 transitions. [2018-12-02 14:36:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-02 14:36:44,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:44,601 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:44,601 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:44,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2027350444, now seen corresponding path program 1 times [2018-12-02 14:36:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:44,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:44,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 14:36:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:36:44,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:36:44,646 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-12-02 14:36:44,646 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [603], [606], [616], [622], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:36:44,647 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:36:44,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:36:44,698 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:36:44,699 INFO L272 AbstractInterpreter]: Visited 157 different actions 212 times. Never merged. Never widened. Performed 1856 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1856 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:36:44,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:44,701 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:36:44,819 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 72.23% of their original sizes. [2018-12-02 14:36:44,819 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:36:46,472 INFO L418 sIntCurrentIteration]: We unified 271 AI predicates to 271 [2018-12-02 14:36:46,472 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:36:46,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:36:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [5] total 80 [2018-12-02 14:36:46,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:46,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-02 14:36:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-02 14:36:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=5357, Unknown=0, NotChecked=0, Total=5852 [2018-12-02 14:36:46,474 INFO L87 Difference]: Start difference. First operand 5322 states and 7066 transitions. Second operand 77 states. [2018-12-02 14:37:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:37:09,280 INFO L93 Difference]: Finished difference Result 5963 states and 7960 transitions. [2018-12-02 14:37:09,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-02 14:37:09,280 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 272 [2018-12-02 14:37:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:37:09,288 INFO L225 Difference]: With dead ends: 5963 [2018-12-02 14:37:09,288 INFO L226 Difference]: Without dead ends: 5475 [2018-12-02 14:37:09,290 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 376 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11226 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2224, Invalid=30718, Unknown=0, NotChecked=0, Total=32942 [2018-12-02 14:37:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2018-12-02 14:37:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5332. [2018-12-02 14:37:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5332 states. [2018-12-02 14:37:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 7082 transitions. [2018-12-02 14:37:09,552 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 7082 transitions. Word has length 272 [2018-12-02 14:37:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:37:09,552 INFO L480 AbstractCegarLoop]: Abstraction has 5332 states and 7082 transitions. [2018-12-02 14:37:09,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-02 14:37:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 7082 transitions. [2018-12-02 14:37:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-02 14:37:09,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:37:09,556 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:37:09,556 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:37:09,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 45810313, now seen corresponding path program 1 times [2018-12-02 14:37:09,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:37:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:37:09,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:09,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:37:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:37:09,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:37:09,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:37:09,600 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-12-02 14:37:09,601 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [603], [609], [616], [619], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:37:09,602 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:37:09,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:37:09,678 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:37:09,678 INFO L272 AbstractInterpreter]: Visited 155 different actions 208 times. Never merged. Never widened. Performed 1848 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:37:09,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:09,680 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:37:09,798 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 73.22% of their original sizes. [2018-12-02 14:37:09,798 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:37:11,132 INFO L418 sIntCurrentIteration]: We unified 271 AI predicates to 271 [2018-12-02 14:37:11,132 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:37:11,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:37:11,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [5] total 81 [2018-12-02 14:37:11,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:37:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-02 14:37:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-02 14:37:11,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=5478, Unknown=0, NotChecked=0, Total=6006 [2018-12-02 14:37:11,133 INFO L87 Difference]: Start difference. First operand 5332 states and 7082 transitions. Second operand 78 states. [2018-12-02 14:37:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:37:37,490 INFO L93 Difference]: Finished difference Result 6792 states and 9192 transitions. [2018-12-02 14:37:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-02 14:37:37,491 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 272 [2018-12-02 14:37:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:37:37,498 INFO L225 Difference]: With dead ends: 6792 [2018-12-02 14:37:37,498 INFO L226 Difference]: Without dead ends: 5853 [2018-12-02 14:37:37,501 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 376 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11306 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2284, Invalid=31022, Unknown=0, NotChecked=0, Total=33306 [2018-12-02 14:37:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2018-12-02 14:37:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5719. [2018-12-02 14:37:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2018-12-02 14:37:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7600 transitions. [2018-12-02 14:37:37,814 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7600 transitions. Word has length 272 [2018-12-02 14:37:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:37:37,815 INFO L480 AbstractCegarLoop]: Abstraction has 5719 states and 7600 transitions. [2018-12-02 14:37:37,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-02 14:37:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7600 transitions. [2018-12-02 14:37:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-02 14:37:37,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:37:37,818 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:37:37,818 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:37:37,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1265443795, now seen corresponding path program 1 times [2018-12-02 14:37:37,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:37:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:37:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:37,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:37:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:37:37,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:37:37,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:37:37,889 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 273 with the following transitions: [2018-12-02 14:37:37,890 INFO L205 CegarAbsIntRunner]: [31], [47], [49], [57], [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [596], [603], [606], [616], [619], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:37:37,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:37:37,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:37:37,939 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:37:37,939 INFO L272 AbstractInterpreter]: Visited 156 different actions 210 times. Never merged. Never widened. Performed 1854 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1854 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:37:37,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:37,941 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:37:38,057 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 72.57% of their original sizes. [2018-12-02 14:37:38,057 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:37:39,452 INFO L418 sIntCurrentIteration]: We unified 271 AI predicates to 271 [2018-12-02 14:37:39,453 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:37:39,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:37:39,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [5] total 80 [2018-12-02 14:37:39,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:37:39,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-02 14:37:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-02 14:37:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=5356, Unknown=0, NotChecked=0, Total=5852 [2018-12-02 14:37:39,454 INFO L87 Difference]: Start difference. First operand 5719 states and 7600 transitions. Second operand 77 states. [2018-12-02 14:37:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:37:56,107 INFO L93 Difference]: Finished difference Result 7152 states and 9644 transitions. [2018-12-02 14:37:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-02 14:37:56,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 272 [2018-12-02 14:37:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:37:56,115 INFO L225 Difference]: With dead ends: 7152 [2018-12-02 14:37:56,115 INFO L226 Difference]: Without dead ends: 6201 [2018-12-02 14:37:56,119 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 357 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8690 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1987, Invalid=24419, Unknown=0, NotChecked=0, Total=26406 [2018-12-02 14:37:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6201 states. [2018-12-02 14:37:56,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6201 to 6073. [2018-12-02 14:37:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6073 states. [2018-12-02 14:37:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6073 states to 6073 states and 8071 transitions. [2018-12-02 14:37:56,415 INFO L78 Accepts]: Start accepts. Automaton has 6073 states and 8071 transitions. Word has length 272 [2018-12-02 14:37:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:37:56,415 INFO L480 AbstractCegarLoop]: Abstraction has 6073 states and 8071 transitions. [2018-12-02 14:37:56,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-02 14:37:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6073 states and 8071 transitions. [2018-12-02 14:37:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-02 14:37:56,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:37:56,420 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:37:56,420 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:37:56,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1629226596, now seen corresponding path program 1 times [2018-12-02 14:37:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:37:56,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:56,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:37:56,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:37:56,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:37:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:37:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 35 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-02 14:37:56,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:37:56,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:37:56,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-12-02 14:37:56,500 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [612], [625], [629], [632], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:37:56,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:37:56,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:37:56,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:37:56,561 INFO L272 AbstractInterpreter]: Visited 144 different actions 207 times. Merged at 4 different actions 4 times. Never widened. Performed 1959 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:37:56,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:37:56,562 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:37:56,711 INFO L227 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 73.16% of their original sizes. [2018-12-02 14:37:56,711 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:37:58,388 INFO L418 sIntCurrentIteration]: We unified 278 AI predicates to 278 [2018-12-02 14:37:58,388 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:37:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:37:58,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [84] imperfect sequences [10] total 92 [2018-12-02 14:37:58,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:37:58,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-02 14:37:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-02 14:37:58,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=6243, Unknown=0, NotChecked=0, Total=6972 [2018-12-02 14:37:58,390 INFO L87 Difference]: Start difference. First operand 6073 states and 8071 transitions. Second operand 84 states. [2018-12-02 14:38:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:38:26,449 INFO L93 Difference]: Finished difference Result 9377 states and 12490 transitions. [2018-12-02 14:38:26,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-02 14:38:26,449 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 279 [2018-12-02 14:38:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:38:26,463 INFO L225 Difference]: With dead ends: 9377 [2018-12-02 14:38:26,464 INFO L226 Difference]: Without dead ends: 6438 [2018-12-02 14:38:26,472 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 405 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15585 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2956, Invalid=41354, Unknown=0, NotChecked=0, Total=44310 [2018-12-02 14:38:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6438 states. [2018-12-02 14:38:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6438 to 6364. [2018-12-02 14:38:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2018-12-02 14:38:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 8431 transitions. [2018-12-02 14:38:26,882 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 8431 transitions. Word has length 279 [2018-12-02 14:38:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:38:26,882 INFO L480 AbstractCegarLoop]: Abstraction has 6364 states and 8431 transitions. [2018-12-02 14:38:26,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-02 14:38:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 8431 transitions. [2018-12-02 14:38:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-02 14:38:26,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:38:26,888 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:38:26,888 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:38:26,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash -813015930, now seen corresponding path program 1 times [2018-12-02 14:38:26,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:38:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:26,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:38:26,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:26,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:38:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:38:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 14:38:26,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:38:26,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:38:26,972 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-12-02 14:38:26,972 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [31], [47], [49], [57], [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [590], [593], [603], [606], [616], [619], [629], [632], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:38:26,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:38:26,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:38:27,023 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:38:27,023 INFO L272 AbstractInterpreter]: Visited 163 different actions 218 times. Never merged. Never widened. Performed 1918 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1918 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 66 variables. [2018-12-02 14:38:27,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:27,025 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:38:27,144 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 72.48% of their original sizes. [2018-12-02 14:38:27,144 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:38:28,475 INFO L418 sIntCurrentIteration]: We unified 277 AI predicates to 277 [2018-12-02 14:38:28,476 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:38:28,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:38:28,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [5] total 82 [2018-12-02 14:38:28,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:38:28,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-02 14:38:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-02 14:38:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=5661, Unknown=0, NotChecked=0, Total=6162 [2018-12-02 14:38:28,477 INFO L87 Difference]: Start difference. First operand 6364 states and 8431 transitions. Second operand 79 states. [2018-12-02 14:38:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:38:52,046 INFO L93 Difference]: Finished difference Result 7366 states and 9867 transitions. [2018-12-02 14:38:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-02 14:38:52,046 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 278 [2018-12-02 14:38:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:38:52,061 INFO L225 Difference]: With dead ends: 7366 [2018-12-02 14:38:52,061 INFO L226 Difference]: Without dead ends: 6878 [2018-12-02 14:38:52,065 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 382 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11516 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2230, Invalid=31442, Unknown=0, NotChecked=0, Total=33672 [2018-12-02 14:38:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2018-12-02 14:38:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6701. [2018-12-02 14:38:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2018-12-02 14:38:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 8868 transitions. [2018-12-02 14:38:52,435 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 8868 transitions. Word has length 278 [2018-12-02 14:38:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:38:52,435 INFO L480 AbstractCegarLoop]: Abstraction has 6701 states and 8868 transitions. [2018-12-02 14:38:52,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-02 14:38:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 8868 transitions. [2018-12-02 14:38:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 14:38:52,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:38:52,439 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:38:52,439 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:38:52,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -745109660, now seen corresponding path program 1 times [2018-12-02 14:38:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:38:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:52,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:38:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:38:52,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:38:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:38:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-12-02 14:38:52,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:38:52,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:38:52,505 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-12-02 14:38:52,505 INFO L205 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [599], [603], [606], [612], [625], [629], [632], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:38:52,507 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:38:52,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:38:52,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:38:52,558 INFO L272 AbstractInterpreter]: Visited 148 different actions 215 times. Merged at 6 different actions 6 times. Never widened. Performed 1998 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1998 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:38:52,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:38:52,559 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:38:52,680 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 72.96% of their original sizes. [2018-12-02 14:38:52,680 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:38:55,143 INFO L418 sIntCurrentIteration]: We unified 279 AI predicates to 279 [2018-12-02 14:38:55,144 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:38:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:38:55,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [83] imperfect sequences [4] total 85 [2018-12-02 14:38:55,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:38:55,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-02 14:38:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-02 14:38:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=6069, Unknown=0, NotChecked=0, Total=6806 [2018-12-02 14:38:55,145 INFO L87 Difference]: Start difference. First operand 6701 states and 8868 transitions. Second operand 83 states. [2018-12-02 14:39:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:39:20,455 INFO L93 Difference]: Finished difference Result 9417 states and 12517 transitions. [2018-12-02 14:39:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-02 14:39:20,455 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 280 [2018-12-02 14:39:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:39:20,464 INFO L225 Difference]: With dead ends: 9417 [2018-12-02 14:39:20,465 INFO L226 Difference]: Without dead ends: 7181 [2018-12-02 14:39:20,469 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 396 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13812 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3091, Invalid=36709, Unknown=0, NotChecked=0, Total=39800 [2018-12-02 14:39:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2018-12-02 14:39:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 7041. [2018-12-02 14:39:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7041 states. [2018-12-02 14:39:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 9309 transitions. [2018-12-02 14:39:20,851 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 9309 transitions. Word has length 280 [2018-12-02 14:39:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:39:20,851 INFO L480 AbstractCegarLoop]: Abstraction has 7041 states and 9309 transitions. [2018-12-02 14:39:20,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-02 14:39:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 9309 transitions. [2018-12-02 14:39:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 14:39:20,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:39:20,856 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:39:20,856 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:39:20,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -840607171, now seen corresponding path program 1 times [2018-12-02 14:39:20,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:39:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:20,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:39:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-02 14:39:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:20,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:39:20,956 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-12-02 14:39:20,957 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:39:20,958 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:39:20,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:39:21,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:39:21,162 INFO L272 AbstractInterpreter]: Visited 159 different actions 567 times. Merged at 40 different actions 82 times. Never widened. Performed 7623 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 66 variables. [2018-12-02 14:39:21,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:21,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:39:21,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:21,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:39:21,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:21,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:39:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:21,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:39:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 14:39:21,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:39:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 14:39:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:39:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-12-02 14:39:21,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:39:21,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:39:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:39:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:39:21,557 INFO L87 Difference]: Start difference. First operand 7041 states and 9309 transitions. Second operand 3 states. [2018-12-02 14:39:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:39:21,993 INFO L93 Difference]: Finished difference Result 11917 states and 16039 transitions. [2018-12-02 14:39:21,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:39:21,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2018-12-02 14:39:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:39:22,004 INFO L225 Difference]: With dead ends: 11917 [2018-12-02 14:39:22,004 INFO L226 Difference]: Without dead ends: 7757 [2018-12-02 14:39:22,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 559 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:39:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2018-12-02 14:39:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 7457. [2018-12-02 14:39:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7457 states. [2018-12-02 14:39:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9722 transitions. [2018-12-02 14:39:22,409 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9722 transitions. Word has length 282 [2018-12-02 14:39:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:39:22,410 INFO L480 AbstractCegarLoop]: Abstraction has 7457 states and 9722 transitions. [2018-12-02 14:39:22,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:39:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9722 transitions. [2018-12-02 14:39:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 14:39:22,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:39:22,414 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:39:22,414 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:39:22,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1480224318, now seen corresponding path program 1 times [2018-12-02 14:39:22,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:39:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:22,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:22,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:39:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-02 14:39:22,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:22,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:39:22,501 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-12-02 14:39:22,501 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:39:22,502 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:39:22,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:39:22,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:39:22,752 INFO L272 AbstractInterpreter]: Visited 160 different actions 623 times. Merged at 40 different actions 108 times. Never widened. Performed 9046 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 8 different actions. Largest state had 66 variables. [2018-12-02 14:39:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:22,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:39:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:22,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:39:22,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:22,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:39:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:22,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:39:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-02 14:39:22,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:39:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 14:39:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:39:23,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-12-02 14:39:23,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:39:23,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:39:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:39:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:39:23,191 INFO L87 Difference]: Start difference. First operand 7457 states and 9722 transitions. Second operand 4 states. [2018-12-02 14:39:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:39:23,856 INFO L93 Difference]: Finished difference Result 11961 states and 16887 transitions. [2018-12-02 14:39:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:39:23,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-12-02 14:39:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:39:23,868 INFO L225 Difference]: With dead ends: 11961 [2018-12-02 14:39:23,868 INFO L226 Difference]: Without dead ends: 8915 [2018-12-02 14:39:23,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 554 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:39:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2018-12-02 14:39:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 8299. [2018-12-02 14:39:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8299 states. [2018-12-02 14:39:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8299 states to 8299 states and 10644 transitions. [2018-12-02 14:39:24,311 INFO L78 Accepts]: Start accepts. Automaton has 8299 states and 10644 transitions. Word has length 283 [2018-12-02 14:39:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:39:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 8299 states and 10644 transitions. [2018-12-02 14:39:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:39:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 8299 states and 10644 transitions. [2018-12-02 14:39:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 14:39:24,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:39:24,316 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:39:24,316 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:39:24,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2035974686, now seen corresponding path program 1 times [2018-12-02 14:39:24,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:39:24,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:24,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:24,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:24,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:39:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 14:39:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:24,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:39:24,403 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-12-02 14:39:24,403 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:39:24,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:39:24,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:39:24,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:39:24,622 INFO L272 AbstractInterpreter]: Visited 159 different actions 560 times. Merged at 40 different actions 82 times. Never widened. Performed 9770 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9770 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 66 variables. [2018-12-02 14:39:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:24,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:39:24,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:24,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:39:24,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:24,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:39:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:24,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:39:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 14:39:24,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:39:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-02 14:39:24,898 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:39:24,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-12-02 14:39:24,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:39:24,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:39:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:39:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:39:24,899 INFO L87 Difference]: Start difference. First operand 8299 states and 10644 transitions. Second operand 3 states. [2018-12-02 14:39:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:39:25,497 INFO L93 Difference]: Finished difference Result 16280 states and 22005 transitions. [2018-12-02 14:39:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:39:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-12-02 14:39:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:39:25,518 INFO L225 Difference]: With dead ends: 16280 [2018-12-02 14:39:25,519 INFO L226 Difference]: Without dead ends: 12220 [2018-12-02 14:39:25,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:39:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2018-12-02 14:39:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 12180. [2018-12-02 14:39:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12180 states. [2018-12-02 14:39:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12180 states to 12180 states and 16068 transitions. [2018-12-02 14:39:26,179 INFO L78 Accepts]: Start accepts. Automaton has 12180 states and 16068 transitions. Word has length 283 [2018-12-02 14:39:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:39:26,179 INFO L480 AbstractCegarLoop]: Abstraction has 12180 states and 16068 transitions. [2018-12-02 14:39:26,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:39:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 12180 states and 16068 transitions. [2018-12-02 14:39:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 14:39:26,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:39:26,185 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:39:26,186 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:39:26,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:26,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1322273065, now seen corresponding path program 1 times [2018-12-02 14:39:26,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:39:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:26,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:39:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-02 14:39:26,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:26,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:39:26,231 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-12-02 14:39:26,231 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [596], [599], [603], [609], [612], [616], [619], [629], [635], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:39:26,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:39:26,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:39:26,284 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:39:26,284 INFO L272 AbstractInterpreter]: Visited 153 different actions 227 times. Merged at 13 different actions 13 times. Never widened. Performed 2056 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2056 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 66 variables. [2018-12-02 14:39:26,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:26,286 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:39:26,423 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.65% of their original sizes. [2018-12-02 14:39:26,424 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:39:28,808 INFO L418 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-12-02 14:39:28,808 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:39:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:39:28,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [86] imperfect sequences [4] total 88 [2018-12-02 14:39:28,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:39:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-02 14:39:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-02 14:39:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=6709, Unknown=0, NotChecked=0, Total=7310 [2018-12-02 14:39:28,810 INFO L87 Difference]: Start difference. First operand 12180 states and 16068 transitions. Second operand 86 states. [2018-12-02 14:39:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:39:44,478 INFO L93 Difference]: Finished difference Result 21039 states and 28581 transitions. [2018-12-02 14:39:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-02 14:39:44,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 282 [2018-12-02 14:39:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:39:44,496 INFO L225 Difference]: With dead ends: 21039 [2018-12-02 14:39:44,496 INFO L226 Difference]: Without dead ends: 11777 [2018-12-02 14:39:44,507 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 371 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10660 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2330, Invalid=28470, Unknown=0, NotChecked=0, Total=30800 [2018-12-02 14:39:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11777 states. [2018-12-02 14:39:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11777 to 11270. [2018-12-02 14:39:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2018-12-02 14:39:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 15063 transitions. [2018-12-02 14:39:45,092 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 15063 transitions. Word has length 282 [2018-12-02 14:39:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:39:45,092 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 15063 transitions. [2018-12-02 14:39:45,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-02 14:39:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 15063 transitions. [2018-12-02 14:39:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-02 14:39:45,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:39:45,099 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:39:45,099 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:39:45,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1448847743, now seen corresponding path program 1 times [2018-12-02 14:39:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:39:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:39:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:39:45,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:39:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:39:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-02 14:39:45,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:39:45,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:39:45,152 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-12-02 14:39:45,152 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [295], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [599], [603], [609], [612], [616], [619], [638], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:39:45,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:39:45,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:39:45,203 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:39:45,203 INFO L272 AbstractInterpreter]: Visited 149 different actions 217 times. Merged at 8 different actions 8 times. Never widened. Performed 2023 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2023 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 64 variables. [2018-12-02 14:39:45,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:39:45,204 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:39:45,334 INFO L227 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 74.16% of their original sizes. [2018-12-02 14:39:45,334 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:39:46,932 INFO L418 sIntCurrentIteration]: We unified 280 AI predicates to 280 [2018-12-02 14:39:46,932 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:39:46,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:39:46,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [84] imperfect sequences [4] total 86 [2018-12-02 14:39:46,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:39:46,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-02 14:39:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-02 14:39:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=6275, Unknown=0, NotChecked=0, Total=6972 [2018-12-02 14:39:46,933 INFO L87 Difference]: Start difference. First operand 11270 states and 15063 transitions. Second operand 84 states. [2018-12-02 14:40:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:04,288 INFO L93 Difference]: Finished difference Result 20741 states and 27846 transitions. [2018-12-02 14:40:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-02 14:40:04,288 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 281 [2018-12-02 14:40:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:04,304 INFO L225 Difference]: With dead ends: 20741 [2018-12-02 14:40:04,304 INFO L226 Difference]: Without dead ends: 11276 [2018-12-02 14:40:04,314 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7625 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2313, Invalid=20639, Unknown=0, NotChecked=0, Total=22952 [2018-12-02 14:40:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states. [2018-12-02 14:40:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 11178. [2018-12-02 14:40:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11178 states. [2018-12-02 14:40:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11178 states to 11178 states and 14907 transitions. [2018-12-02 14:40:04,893 INFO L78 Accepts]: Start accepts. Automaton has 11178 states and 14907 transitions. Word has length 281 [2018-12-02 14:40:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:04,893 INFO L480 AbstractCegarLoop]: Abstraction has 11178 states and 14907 transitions. [2018-12-02 14:40:04,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-02 14:40:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 11178 states and 14907 transitions. [2018-12-02 14:40:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 14:40:04,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:04,900 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:04,900 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:04,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2131632361, now seen corresponding path program 1 times [2018-12-02 14:40:04,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:04,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:04,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-02 14:40:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:40:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:40:04,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:04,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:40:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:40:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:40:04,942 INFO L87 Difference]: Start difference. First operand 11178 states and 14907 transitions. Second operand 4 states. [2018-12-02 14:40:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:06,193 INFO L93 Difference]: Finished difference Result 28767 states and 41063 transitions. [2018-12-02 14:40:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:40:06,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-12-02 14:40:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:06,226 INFO L225 Difference]: With dead ends: 28767 [2018-12-02 14:40:06,226 INFO L226 Difference]: Without dead ends: 18043 [2018-12-02 14:40:06,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:40:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18043 states. [2018-12-02 14:40:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18043 to 17621. [2018-12-02 14:40:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17621 states. [2018-12-02 14:40:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17621 states to 17621 states and 24868 transitions. [2018-12-02 14:40:07,255 INFO L78 Accepts]: Start accepts. Automaton has 17621 states and 24868 transitions. Word has length 282 [2018-12-02 14:40:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:07,255 INFO L480 AbstractCegarLoop]: Abstraction has 17621 states and 24868 transitions. [2018-12-02 14:40:07,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:40:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17621 states and 24868 transitions. [2018-12-02 14:40:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 14:40:07,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:07,266 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:07,266 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:07,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1186743594, now seen corresponding path program 1 times [2018-12-02 14:40:07,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:07,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:07,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 14:40:07,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:07,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:07,328 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-02 14:40:07,328 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [647], [650], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:07,329 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:07,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:07,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:40:07,494 INFO L272 AbstractInterpreter]: Visited 160 different actions 460 times. Merged at 39 different actions 60 times. Never widened. Performed 7173 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7173 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 6 different actions. Largest state had 66 variables. [2018-12-02 14:40:07,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:07,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:40:07,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:07,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:40:07,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:07,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:40:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:07,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:40:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-02 14:40:07,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:40:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-02 14:40:07,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:40:07,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-12-02 14:40:07,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:07,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:40:07,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:40:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:40:07,837 INFO L87 Difference]: Start difference. First operand 17621 states and 24868 transitions. Second operand 4 states. [2018-12-02 14:40:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:09,277 INFO L93 Difference]: Finished difference Result 36767 states and 58126 transitions. [2018-12-02 14:40:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:40:09,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-12-02 14:40:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:09,320 INFO L225 Difference]: With dead ends: 36767 [2018-12-02 14:40:09,321 INFO L226 Difference]: Without dead ends: 20847 [2018-12-02 14:40:09,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 556 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:40:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20847 states. [2018-12-02 14:40:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20847 to 19175. [2018-12-02 14:40:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19175 states. [2018-12-02 14:40:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19175 states to 19175 states and 26480 transitions. [2018-12-02 14:40:10,511 INFO L78 Accepts]: Start accepts. Automaton has 19175 states and 26480 transitions. Word has length 284 [2018-12-02 14:40:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:10,511 INFO L480 AbstractCegarLoop]: Abstraction has 19175 states and 26480 transitions. [2018-12-02 14:40:10,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:40:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19175 states and 26480 transitions. [2018-12-02 14:40:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 14:40:10,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:10,526 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:10,527 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:10,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 868513462, now seen corresponding path program 1 times [2018-12-02 14:40:10,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:10,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-02 14:40:10,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:10,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:10,590 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-02 14:40:10,590 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:10,591 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:10,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:10,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:40:10,759 INFO L272 AbstractInterpreter]: Visited 159 different actions 491 times. Merged at 39 different actions 76 times. Never widened. Performed 7376 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7376 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 5 different actions. Largest state had 66 variables. [2018-12-02 14:40:10,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:10,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:40:10,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:10,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:40:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:10,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:40:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:10,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:40:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 14:40:10,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:40:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-02 14:40:11,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:40:11,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-12-02 14:40:11,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:11,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:40:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:40:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:40:11,051 INFO L87 Difference]: Start difference. First operand 19175 states and 26480 transitions. Second operand 6 states. [2018-12-02 14:40:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:12,115 INFO L93 Difference]: Finished difference Result 28293 states and 40570 transitions. [2018-12-02 14:40:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:40:12,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-12-02 14:40:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:12,147 INFO L225 Difference]: With dead ends: 28293 [2018-12-02 14:40:12,147 INFO L226 Difference]: Without dead ends: 19447 [2018-12-02 14:40:12,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 563 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:40:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19447 states. [2018-12-02 14:40:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19447 to 19255. [2018-12-02 14:40:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2018-12-02 14:40:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 26560 transitions. [2018-12-02 14:40:13,292 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 26560 transitions. Word has length 284 [2018-12-02 14:40:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:13,293 INFO L480 AbstractCegarLoop]: Abstraction has 19255 states and 26560 transitions. [2018-12-02 14:40:13,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:40:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 26560 transitions. [2018-12-02 14:40:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 14:40:13,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:13,309 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:13,309 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 374371481, now seen corresponding path program 1 times [2018-12-02 14:40:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:13,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:13,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 37 proven. 19 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-02 14:40:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:13,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:13,351 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-02 14:40:13,351 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [599], [603], [609], [612], [616], [622], [625], [629], [632], [635], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:13,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:13,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:13,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:40:13,490 INFO L272 AbstractInterpreter]: Visited 158 different actions 407 times. Merged at 18 different actions 34 times. Never widened. Performed 6370 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 66 variables. [2018-12-02 14:40:13,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:13,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:40:13,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:13,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:40:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:13,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:40:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:13,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:40:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 14:40:13,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:40:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 37 proven. 19 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-12-02 14:40:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:40:13,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-12-02 14:40:13,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:13,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:40:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:40:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:40:13,708 INFO L87 Difference]: Start difference. First operand 19255 states and 26560 transitions. Second operand 3 states. [2018-12-02 14:40:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:14,694 INFO L93 Difference]: Finished difference Result 27713 states and 39504 transitions. [2018-12-02 14:40:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:40:14,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-02 14:40:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:14,728 INFO L225 Difference]: With dead ends: 27713 [2018-12-02 14:40:14,728 INFO L226 Difference]: Without dead ends: 18723 [2018-12-02 14:40:14,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:40:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18723 states. [2018-12-02 14:40:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18723 to 18715. [2018-12-02 14:40:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18715 states. [2018-12-02 14:40:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18715 states to 18715 states and 25546 transitions. [2018-12-02 14:40:15,833 INFO L78 Accepts]: Start accepts. Automaton has 18715 states and 25546 transitions. Word has length 285 [2018-12-02 14:40:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:15,834 INFO L480 AbstractCegarLoop]: Abstraction has 18715 states and 25546 transitions. [2018-12-02 14:40:15,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:40:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 18715 states and 25546 transitions. [2018-12-02 14:40:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-02 14:40:15,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:15,844 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:15,844 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1283061787, now seen corresponding path program 1 times [2018-12-02 14:40:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:15,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-02 14:40:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:40:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:40:15,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:15,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:40:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:40:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:40:15,891 INFO L87 Difference]: Start difference. First operand 18715 states and 25546 transitions. Second operand 4 states. [2018-12-02 14:40:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:17,993 INFO L93 Difference]: Finished difference Result 48806 states and 72612 transitions. [2018-12-02 14:40:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:40:17,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2018-12-02 14:40:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:18,061 INFO L225 Difference]: With dead ends: 48806 [2018-12-02 14:40:18,061 INFO L226 Difference]: Without dead ends: 30503 [2018-12-02 14:40:18,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:40:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30503 states. [2018-12-02 14:40:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30503 to 29331. [2018-12-02 14:40:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29331 states. [2018-12-02 14:40:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29331 states to 29331 states and 43292 transitions. [2018-12-02 14:40:19,954 INFO L78 Accepts]: Start accepts. Automaton has 29331 states and 43292 transitions. Word has length 291 [2018-12-02 14:40:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 29331 states and 43292 transitions. [2018-12-02 14:40:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:40:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 29331 states and 43292 transitions. [2018-12-02 14:40:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-02 14:40:19,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:19,971 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:19,971 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1450571922, now seen corresponding path program 1 times [2018-12-02 14:40:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:19,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:19,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-02 14:40:20,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:20,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:20,013 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-12-02 14:40:20,014 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [354], [359], [362], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [593], [599], [603], [609], [616], [622], [625], [629], [632], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:20,014 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:20,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:20,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:40:20,069 INFO L272 AbstractInterpreter]: Visited 159 different actions 234 times. Merged at 14 different actions 14 times. Never widened. Performed 2137 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 66 variables. [2018-12-02 14:40:20,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:20,070 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:40:20,214 INFO L227 lantSequenceWeakener]: Weakened 229 states. On average, predicates are now at 74.38% of their original sizes. [2018-12-02 14:40:20,214 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:40:22,315 INFO L418 sIntCurrentIteration]: We unified 291 AI predicates to 291 [2018-12-02 14:40:22,315 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:40:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:40:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [91] imperfect sequences [4] total 93 [2018-12-02 14:40:22,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:22,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-02 14:40:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-02 14:40:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=7527, Unknown=0, NotChecked=0, Total=8190 [2018-12-02 14:40:22,317 INFO L87 Difference]: Start difference. First operand 29331 states and 43292 transitions. Second operand 91 states. [2018-12-02 14:40:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:44,838 INFO L93 Difference]: Finished difference Result 47377 states and 72209 transitions. [2018-12-02 14:40:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-02 14:40:44,839 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 292 [2018-12-02 14:40:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:44,892 INFO L225 Difference]: With dead ends: 47377 [2018-12-02 14:40:44,892 INFO L226 Difference]: Without dead ends: 29365 [2018-12-02 14:40:44,926 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 382 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11561 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2443, Invalid=30499, Unknown=0, NotChecked=0, Total=32942 [2018-12-02 14:40:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29365 states. [2018-12-02 14:40:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29365 to 27825. [2018-12-02 14:40:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27825 states. [2018-12-02 14:40:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27825 states to 27825 states and 39644 transitions. [2018-12-02 14:40:46,592 INFO L78 Accepts]: Start accepts. Automaton has 27825 states and 39644 transitions. Word has length 292 [2018-12-02 14:40:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:46,593 INFO L480 AbstractCegarLoop]: Abstraction has 27825 states and 39644 transitions. [2018-12-02 14:40:46,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-02 14:40:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27825 states and 39644 transitions. [2018-12-02 14:40:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-02 14:40:46,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:46,610 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:46,610 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:46,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -641720913, now seen corresponding path program 1 times [2018-12-02 14:40:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:46,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-02 14:40:46,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:46,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:46,726 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-12-02 14:40:46,726 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [593], [596], [603], [609], [616], [619], [625], [629], [632], [635], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:46,727 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:46,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:46,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:40:46,839 INFO L272 AbstractInterpreter]: Visited 165 different actions 402 times. Merged at 24 different actions 60 times. Never widened. Performed 4620 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4620 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 7 different actions. Largest state had 66 variables. [2018-12-02 14:40:46,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:46,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:40:46,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:46,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:40:46,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:46,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:40:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:46,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:40:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 14:40:46,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:40:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-12-02 14:40:47,114 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:40:47,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 7 [2018-12-02 14:40:47,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:47,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:40:47,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:40:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:40:47,115 INFO L87 Difference]: Start difference. First operand 27825 states and 39644 transitions. Second operand 3 states. [2018-12-02 14:40:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:49,971 INFO L93 Difference]: Finished difference Result 72654 states and 117806 transitions. [2018-12-02 14:40:49,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:40:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-02 14:40:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:50,071 INFO L225 Difference]: With dead ends: 72654 [2018-12-02 14:40:50,071 INFO L226 Difference]: Without dead ends: 46133 [2018-12-02 14:40:50,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:40:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46133 states. [2018-12-02 14:40:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46133 to 45913. [2018-12-02 14:40:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45913 states. [2018-12-02 14:40:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45913 states to 45913 states and 69867 transitions. [2018-12-02 14:40:53,177 INFO L78 Accepts]: Start accepts. Automaton has 45913 states and 69867 transitions. Word has length 292 [2018-12-02 14:40:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:40:53,177 INFO L480 AbstractCegarLoop]: Abstraction has 45913 states and 69867 transitions. [2018-12-02 14:40:53,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:40:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 45913 states and 69867 transitions. [2018-12-02 14:40:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-02 14:40:53,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:40:53,207 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:40:53,207 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:40:53,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1411184111, now seen corresponding path program 1 times [2018-12-02 14:40:53,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:40:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:40:53,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:40:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-02 14:40:53,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:53,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:40:53,253 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-12-02 14:40:53,254 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [593], [596], [603], [609], [616], [622], [625], [629], [632], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:40:53,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:40:53,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:40:53,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:40:53,537 INFO L272 AbstractInterpreter]: Visited 170 different actions 905 times. Merged at 49 different actions 180 times. Never widened. Performed 10186 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 28 fixpoints after 9 different actions. Largest state had 66 variables. [2018-12-02 14:40:53,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:40:53,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:40:53,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:40:53,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:40:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:40:53,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:40:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:40:53,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:40:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 14:40:53,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:40:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-12-02 14:40:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:40:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-02 14:40:53,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:40:53,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:40:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:40:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:40:53,786 INFO L87 Difference]: Start difference. First operand 45913 states and 69867 transitions. Second operand 4 states. [2018-12-02 14:40:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:40:59,056 INFO L93 Difference]: Finished difference Result 101337 states and 179139 transitions. [2018-12-02 14:40:59,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:40:59,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-12-02 14:40:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:40:59,259 INFO L225 Difference]: With dead ends: 101337 [2018-12-02 14:40:59,259 INFO L226 Difference]: Without dead ends: 79631 [2018-12-02 14:40:59,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:40:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79631 states. [2018-12-02 14:41:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79631 to 78610. [2018-12-02 14:41:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78610 states. [2018-12-02 14:41:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78610 states to 78610 states and 140231 transitions. [2018-12-02 14:41:05,133 INFO L78 Accepts]: Start accepts. Automaton has 78610 states and 140231 transitions. Word has length 292 [2018-12-02 14:41:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:41:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 78610 states and 140231 transitions. [2018-12-02 14:41:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:41:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 78610 states and 140231 transitions. [2018-12-02 14:41:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-02 14:41:05,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:41:05,351 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:41:05,352 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:41:05,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1712467274, now seen corresponding path program 1 times [2018-12-02 14:41:05,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:41:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:05,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:41:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-02 14:41:05,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:05,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:41:05,401 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-12-02 14:41:05,402 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [593], [596], [603], [609], [616], [622], [625], [629], [632], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:41:05,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:41:05,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:41:05,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:41:05,741 INFO L272 AbstractInterpreter]: Visited 168 different actions 1118 times. Merged at 53 different actions 172 times. Never widened. Performed 14221 root evaluator evaluations with a maximum evaluation depth of 3. Performed 14221 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 29 fixpoints after 8 different actions. Largest state had 66 variables. [2018-12-02 14:41:05,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:05,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:41:05,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:05,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:41:05,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:05,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:41:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:05,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:41:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-02 14:41:05,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:41:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-02 14:41:06,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:41:06,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-12-02 14:41:06,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:41:06,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:41:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:41:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:41:06,029 INFO L87 Difference]: Start difference. First operand 78610 states and 140231 transitions. Second operand 6 states. [2018-12-02 14:41:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:41:11,116 INFO L93 Difference]: Finished difference Result 146119 states and 273780 transitions. [2018-12-02 14:41:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:41:11,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 293 [2018-12-02 14:41:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:41:11,329 INFO L225 Difference]: With dead ends: 146119 [2018-12-02 14:41:11,329 INFO L226 Difference]: Without dead ends: 69837 [2018-12-02 14:41:11,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 583 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:41:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69837 states. [2018-12-02 14:41:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69837 to 69762. [2018-12-02 14:41:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69762 states. [2018-12-02 14:41:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69762 states to 69762 states and 114166 transitions. [2018-12-02 14:41:18,126 INFO L78 Accepts]: Start accepts. Automaton has 69762 states and 114166 transitions. Word has length 293 [2018-12-02 14:41:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:41:18,127 INFO L480 AbstractCegarLoop]: Abstraction has 69762 states and 114166 transitions. [2018-12-02 14:41:18,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:41:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 69762 states and 114166 transitions. [2018-12-02 14:41:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-02 14:41:18,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:41:18,172 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:41:18,172 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:41:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1483093733, now seen corresponding path program 1 times [2018-12-02 14:41:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:41:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:18,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:41:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-12-02 14:41:18,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:18,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:41:18,222 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 291 with the following transitions: [2018-12-02 14:41:18,222 INFO L205 CegarAbsIntRunner]: [31], [47], [49], [57], [60], [62], [65], [76], [78], [80], [82], [86], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [606], [616], [619], [625], [629], [635], [638], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [716], [717], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [752], [753], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:41:18,223 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:41:18,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:41:18,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:41:18,431 INFO L272 AbstractInterpreter]: Visited 167 different actions 618 times. Merged at 19 different actions 56 times. Never widened. Performed 9645 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9645 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 6 different actions. Largest state had 66 variables. [2018-12-02 14:41:18,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:18,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:41:18,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:18,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:41:18,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:18,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:41:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:18,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:41:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 14:41:18,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:41:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-12-02 14:41:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:41:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [4] total 8 [2018-12-02 14:41:18,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:41:18,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:41:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:41:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:41:18,720 INFO L87 Difference]: Start difference. First operand 69762 states and 114166 transitions. Second operand 4 states. [2018-12-02 14:41:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:41:23,887 INFO L93 Difference]: Finished difference Result 130025 states and 230924 transitions. [2018-12-02 14:41:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:41:23,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-12-02 14:41:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:41:24,048 INFO L225 Difference]: With dead ends: 130025 [2018-12-02 14:41:24,048 INFO L226 Difference]: Without dead ends: 62347 [2018-12-02 14:41:24,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 567 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:41:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62347 states. [2018-12-02 14:41:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62347 to 60708. [2018-12-02 14:41:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60708 states. [2018-12-02 14:41:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60708 states to 60708 states and 92351 transitions. [2018-12-02 14:41:28,899 INFO L78 Accepts]: Start accepts. Automaton has 60708 states and 92351 transitions. Word has length 290 [2018-12-02 14:41:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:41:28,899 INFO L480 AbstractCegarLoop]: Abstraction has 60708 states and 92351 transitions. [2018-12-02 14:41:28,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:41:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 60708 states and 92351 transitions. [2018-12-02 14:41:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 14:41:28,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:41:28,939 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:41:28,939 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:41:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 571612554, now seen corresponding path program 1 times [2018-12-02 14:41:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:41:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:28,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:28,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:41:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-12-02 14:41:28,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:28,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:41:28,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-02 14:41:28,991 INFO L205 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [222], [224], [226], [227], [289], [292], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [336], [339], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [606], [612], [616], [622], [625], [629], [632], [635], [644], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:41:28,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:41:28,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:41:29,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:41:29,139 INFO L272 AbstractInterpreter]: Visited 157 different actions 404 times. Merged at 18 different actions 34 times. Never widened. Performed 6549 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6549 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 66 variables. [2018-12-02 14:41:29,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:29,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:41:29,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:29,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:41:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:29,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:41:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:29,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:41:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-02 14:41:29,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:41:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-02 14:41:29,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:41:29,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-02 14:41:29,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:41:29,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:41:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:41:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:41:29,523 INFO L87 Difference]: Start difference. First operand 60708 states and 92351 transitions. Second operand 3 states. [2018-12-02 14:41:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:41:33,035 INFO L93 Difference]: Finished difference Result 93133 states and 140605 transitions. [2018-12-02 14:41:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:41:33,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-02 14:41:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:41:33,141 INFO L225 Difference]: With dead ends: 93133 [2018-12-02 14:41:33,141 INFO L226 Difference]: Without dead ends: 49051 [2018-12-02 14:41:33,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 561 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:41:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49051 states. [2018-12-02 14:41:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49051 to 49051. [2018-12-02 14:41:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49051 states. [2018-12-02 14:41:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49051 states to 49051 states and 71272 transitions. [2018-12-02 14:41:36,728 INFO L78 Accepts]: Start accepts. Automaton has 49051 states and 71272 transitions. Word has length 285 [2018-12-02 14:41:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:41:36,729 INFO L480 AbstractCegarLoop]: Abstraction has 49051 states and 71272 transitions. [2018-12-02 14:41:36,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:41:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 49051 states and 71272 transitions. [2018-12-02 14:41:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-02 14:41:36,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:41:36,790 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:41:36,790 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:41:36,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 145838299, now seen corresponding path program 1 times [2018-12-02 14:41:36,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:41:36,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:36,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:36,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:41:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 24 proven. 61 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-12-02 14:41:36,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:36,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:41:36,844 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-12-02 14:41:36,845 INFO L205 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [609], [616], [619], [622], [629], [632], [644], [647], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:41:36,846 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:41:36,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:41:37,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:41:37,059 INFO L272 AbstractInterpreter]: Visited 164 different actions 741 times. Merged at 52 different actions 111 times. Never widened. Performed 9093 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9093 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 6 different actions. Largest state had 66 variables. [2018-12-02 14:41:37,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:37,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:41:37,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:37,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:41:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:37,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:41:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:37,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:41:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-02 14:41:37,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:41:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 35 proven. 28 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-12-02 14:41:37,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:41:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-02 14:41:37,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:41:37,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:41:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:41:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:41:37,389 INFO L87 Difference]: Start difference. First operand 49051 states and 71272 transitions. Second operand 3 states. [2018-12-02 14:41:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:41:40,791 INFO L93 Difference]: Finished difference Result 85208 states and 124361 transitions. [2018-12-02 14:41:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:41:40,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2018-12-02 14:41:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:41:40,903 INFO L225 Difference]: With dead ends: 85208 [2018-12-02 14:41:40,903 INFO L226 Difference]: Without dead ends: 49051 [2018-12-02 14:41:41,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 695 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:41:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49051 states. [2018-12-02 14:41:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49051 to 49051. [2018-12-02 14:41:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49051 states. [2018-12-02 14:41:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49051 states to 49051 states and 69767 transitions. [2018-12-02 14:41:45,209 INFO L78 Accepts]: Start accepts. Automaton has 49051 states and 69767 transitions. Word has length 352 [2018-12-02 14:41:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:41:45,210 INFO L480 AbstractCegarLoop]: Abstraction has 49051 states and 69767 transitions. [2018-12-02 14:41:45,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:41:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49051 states and 69767 transitions. [2018-12-02 14:41:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-12-02 14:41:45,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:41:45,256 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:41:45,256 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:41:45,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash -399802081, now seen corresponding path program 1 times [2018-12-02 14:41:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:41:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:45,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:41:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:41:45,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:41:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:41:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 14:41:45,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:41:45,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:41:45,369 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-12-02 14:41:45,369 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [586], [590], [596], [603], [609], [616], [619], [629], [632], [644], [647], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:41:45,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:41:45,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:41:45,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 14:41:45,423 INFO L272 AbstractInterpreter]: Visited 157 different actions 229 times. Merged at 13 different actions 13 times. Never widened. Performed 2112 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 66 variables. [2018-12-02 14:41:45,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:41:45,425 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 14:41:45,573 INFO L227 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 74.25% of their original sizes. [2018-12-02 14:41:45,573 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 14:41:47,815 INFO L418 sIntCurrentIteration]: We unified 355 AI predicates to 355 [2018-12-02 14:41:47,815 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 14:41:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:41:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [91] imperfect sequences [4] total 93 [2018-12-02 14:41:47,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:41:47,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-02 14:41:47,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-02 14:41:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=7576, Unknown=0, NotChecked=0, Total=8190 [2018-12-02 14:41:47,816 INFO L87 Difference]: Start difference. First operand 49051 states and 69767 transitions. Second operand 91 states. [2018-12-02 14:42:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:42:11,999 INFO L93 Difference]: Finished difference Result 74243 states and 108381 transitions. [2018-12-02 14:42:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-02 14:42:11,999 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2018-12-02 14:42:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:42:12,113 INFO L225 Difference]: With dead ends: 74243 [2018-12-02 14:42:12,114 INFO L226 Difference]: Without dead ends: 54738 [2018-12-02 14:42:12,162 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 455 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12799 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2520, Invalid=33770, Unknown=0, NotChecked=0, Total=36290 [2018-12-02 14:42:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54738 states. [2018-12-02 14:42:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54738 to 49076. [2018-12-02 14:42:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49076 states. [2018-12-02 14:42:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49076 states to 49076 states and 69795 transitions. [2018-12-02 14:42:15,744 INFO L78 Accepts]: Start accepts. Automaton has 49076 states and 69795 transitions. Word has length 356 [2018-12-02 14:42:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:42:15,745 INFO L480 AbstractCegarLoop]: Abstraction has 49076 states and 69795 transitions. [2018-12-02 14:42:15,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-02 14:42:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49076 states and 69795 transitions. [2018-12-02 14:42:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-02 14:42:15,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:42:15,792 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:42:15,793 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:42:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1233138123, now seen corresponding path program 1 times [2018-12-02 14:42:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:42:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:15,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:42:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 14:42:15,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:15,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:42:15,854 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-12-02 14:42:15,854 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [609], [616], [619], [629], [632], [644], [647], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:42:15,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:42:15,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:42:16,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:42:16,074 INFO L272 AbstractInterpreter]: Visited 174 different actions 714 times. Merged at 58 different actions 135 times. Never widened. Performed 8934 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8934 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 15 fixpoints after 7 different actions. Largest state had 66 variables. [2018-12-02 14:42:16,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:16,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:42:16,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:16,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:42:16,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:16,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:42:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:16,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:42:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 14:42:16,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:42:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 14:42:16,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:42:16,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-02 14:42:16,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:42:16,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:42:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:42:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:42:16,526 INFO L87 Difference]: Start difference. First operand 49076 states and 69795 transitions. Second operand 4 states. [2018-12-02 14:42:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:42:23,578 INFO L93 Difference]: Finished difference Result 132500 states and 211582 transitions. [2018-12-02 14:42:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:42:23,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2018-12-02 14:42:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:42:23,784 INFO L225 Difference]: With dead ends: 132500 [2018-12-02 14:42:23,784 INFO L226 Difference]: Without dead ends: 95191 [2018-12-02 14:42:23,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 721 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:42:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95191 states. [2018-12-02 14:42:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95191 to 89894. [2018-12-02 14:42:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89894 states. [2018-12-02 14:42:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89894 states to 89894 states and 140845 transitions. [2018-12-02 14:42:31,121 INFO L78 Accepts]: Start accepts. Automaton has 89894 states and 140845 transitions. Word has length 358 [2018-12-02 14:42:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:42:31,122 INFO L480 AbstractCegarLoop]: Abstraction has 89894 states and 140845 transitions. [2018-12-02 14:42:31,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:42:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 89894 states and 140845 transitions. [2018-12-02 14:42:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-02 14:42:31,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:42:31,197 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:42:31,198 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:42:31,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:31,198 INFO L82 PathProgramCache]: Analyzing trace with hash 269960183, now seen corresponding path program 1 times [2018-12-02 14:42:31,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:42:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:31,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:31,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:42:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 35 proven. 24 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-02 14:42:31,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:31,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:42:31,267 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-12-02 14:42:31,268 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [609], [616], [619], [629], [632], [644], [647], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:42:31,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:42:31,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:42:31,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:42:31,674 INFO L272 AbstractInterpreter]: Visited 175 different actions 1302 times. Merged at 63 different actions 266 times. Never widened. Performed 16373 root evaluator evaluations with a maximum evaluation depth of 3. Performed 16373 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 31 fixpoints after 13 different actions. Largest state had 66 variables. [2018-12-02 14:42:31,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:31,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:42:31,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:31,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:42:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:31,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:42:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:31,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:42:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-12-02 14:42:31,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:42:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 35 proven. 24 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-02 14:42:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:42:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-12-02 14:42:31,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:42:31,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:42:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:42:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:42:31,973 INFO L87 Difference]: Start difference. First operand 89894 states and 140845 transitions. Second operand 6 states. [2018-12-02 14:42:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:42:38,814 INFO L93 Difference]: Finished difference Result 160621 states and 267521 transitions. [2018-12-02 14:42:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:42:38,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2018-12-02 14:42:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:42:39,004 INFO L225 Difference]: With dead ends: 160621 [2018-12-02 14:42:39,004 INFO L226 Difference]: Without dead ends: 72799 [2018-12-02 14:42:39,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 713 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:42:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72799 states. [2018-12-02 14:42:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72799 to 70644. [2018-12-02 14:42:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70644 states. [2018-12-02 14:42:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70644 states to 70644 states and 104874 transitions. [2018-12-02 14:42:44,972 INFO L78 Accepts]: Start accepts. Automaton has 70644 states and 104874 transitions. Word has length 358 [2018-12-02 14:42:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:42:44,973 INFO L480 AbstractCegarLoop]: Abstraction has 70644 states and 104874 transitions. [2018-12-02 14:42:44,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:42:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70644 states and 104874 transitions. [2018-12-02 14:42:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-12-02 14:42:45,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:42:45,091 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:42:45,091 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:42:45,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 577975005, now seen corresponding path program 1 times [2018-12-02 14:42:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:42:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:45,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:42:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2018-12-02 14:42:45,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:45,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:42:45,192 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 564 with the following transitions: [2018-12-02 14:42:45,193 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [380], [382], [386], [388], [392], [394], [400], [404], [406], [412], [418], [422], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [590], [596], [603], [606], [609], [616], [619], [625], [629], [632], [638], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:42:45,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:42:45,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:42:45,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:42:45,714 INFO L272 AbstractInterpreter]: Visited 198 different actions 1718 times. Merged at 66 different actions 277 times. Widened at 1 different actions 1 times. Performed 21003 root evaluator evaluations with a maximum evaluation depth of 3. Performed 21003 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 53 fixpoints after 12 different actions. Largest state had 66 variables. [2018-12-02 14:42:45,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:45,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:42:45,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:45,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:42:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:45,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:42:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:45,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:42:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-12-02 14:42:45,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:42:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 64 proven. 26 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-12-02 14:42:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:42:46,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-12-02 14:42:46,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:42:46,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:42:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:42:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:42:46,178 INFO L87 Difference]: Start difference. First operand 70644 states and 104874 transitions. Second operand 3 states. [2018-12-02 14:42:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:42:51,192 INFO L93 Difference]: Finished difference Result 132498 states and 203489 transitions. [2018-12-02 14:42:51,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:42:51,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 563 [2018-12-02 14:42:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:42:51,349 INFO L225 Difference]: With dead ends: 132498 [2018-12-02 14:42:51,349 INFO L226 Difference]: Without dead ends: 63876 [2018-12-02 14:42:51,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 1129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:42:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63876 states. [2018-12-02 14:42:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63876 to 62334. [2018-12-02 14:42:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62334 states. [2018-12-02 14:42:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62334 states to 62334 states and 89305 transitions. [2018-12-02 14:42:56,312 INFO L78 Accepts]: Start accepts. Automaton has 62334 states and 89305 transitions. Word has length 563 [2018-12-02 14:42:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:42:56,313 INFO L480 AbstractCegarLoop]: Abstraction has 62334 states and 89305 transitions. [2018-12-02 14:42:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:42:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 62334 states and 89305 transitions. [2018-12-02 14:42:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2018-12-02 14:42:56,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:42:56,412 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:42:56,412 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:42:56,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -811525736, now seen corresponding path program 1 times [2018-12-02 14:42:56,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:42:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:56,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:42:56,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:42:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2018-12-02 14:42:56,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:56,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:42:56,535 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 642 with the following transitions: [2018-12-02 14:42:56,535 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [376], [377], [380], [382], [386], [388], [392], [394], [400], [404], [406], [412], [418], [422], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [596], [603], [606], [609], [616], [619], [622], [629], [632], [635], [638], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:42:56,537 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:42:56,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:42:57,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:42:57,159 INFO L272 AbstractInterpreter]: Visited 202 different actions 2142 times. Merged at 69 different actions 325 times. Widened at 1 different actions 1 times. Performed 25348 root evaluator evaluations with a maximum evaluation depth of 3. Performed 25348 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 82 fixpoints after 15 different actions. Largest state had 66 variables. [2018-12-02 14:42:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:42:57,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:42:57,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:42:57,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:42:57,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:42:57,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:42:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:42:57,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:42:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2018-12-02 14:42:57,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:42:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2018-12-02 14:42:57,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:42:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2018-12-02 14:42:57,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:42:57,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:42:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:42:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:42:57,789 INFO L87 Difference]: Start difference. First operand 62334 states and 89305 transitions. Second operand 3 states. [2018-12-02 14:43:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:01,885 INFO L93 Difference]: Finished difference Result 111199 states and 164918 transitions. [2018-12-02 14:43:01,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:43:01,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 641 [2018-12-02 14:43:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:02,018 INFO L225 Difference]: With dead ends: 111199 [2018-12-02 14:43:02,018 INFO L226 Difference]: Without dead ends: 53205 [2018-12-02 14:43:02,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1284 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:43:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53205 states. [2018-12-02 14:43:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53205 to 52384. [2018-12-02 14:43:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52384 states. [2018-12-02 14:43:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52384 states to 52384 states and 72752 transitions. [2018-12-02 14:43:06,140 INFO L78 Accepts]: Start accepts. Automaton has 52384 states and 72752 transitions. Word has length 641 [2018-12-02 14:43:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:06,141 INFO L480 AbstractCegarLoop]: Abstraction has 52384 states and 72752 transitions. [2018-12-02 14:43:06,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:43:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 52384 states and 72752 transitions. [2018-12-02 14:43:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-12-02 14:43:06,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:06,183 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:06,183 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:06,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash 422530591, now seen corresponding path program 1 times [2018-12-02 14:43:06,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:06,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-12-02 14:43:06,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:06,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:43:06,254 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 428 with the following transitions: [2018-12-02 14:43:06,254 INFO L205 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [135], [138], [141], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [577], [580], [583], [590], [596], [603], [606], [616], [619], [629], [632], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [706], [710], [711], [714], [715], [716], [717], [718], [719], [720], [721], [722], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [786], [787], [788] [2018-12-02 14:43:06,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:43:06,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:43:06,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:43:06,419 INFO L272 AbstractInterpreter]: Visited 181 different actions 550 times. Merged at 29 different actions 41 times. Never widened. Performed 7532 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7532 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 66 variables. [2018-12-02 14:43:06,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:06,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:43:06,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:06,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:43:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:06,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:43:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:06,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:43:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-12-02 14:43:06,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:43:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2018-12-02 14:43:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:43:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2018-12-02 14:43:06,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:43:06,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:43:06,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:43:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:43:06,837 INFO L87 Difference]: Start difference. First operand 52384 states and 72752 transitions. Second operand 4 states. [2018-12-02 14:43:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:10,711 INFO L93 Difference]: Finished difference Result 95771 states and 141340 transitions. [2018-12-02 14:43:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:43:10,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2018-12-02 14:43:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:10,838 INFO L225 Difference]: With dead ends: 95771 [2018-12-02 14:43:10,838 INFO L226 Difference]: Without dead ends: 45785 [2018-12-02 14:43:11,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 841 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:43:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45785 states. [2018-12-02 14:43:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45785 to 42294. [2018-12-02 14:43:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42294 states. [2018-12-02 14:43:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42294 states to 42294 states and 56602 transitions. [2018-12-02 14:43:14,364 INFO L78 Accepts]: Start accepts. Automaton has 42294 states and 56602 transitions. Word has length 427 [2018-12-02 14:43:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:14,365 INFO L480 AbstractCegarLoop]: Abstraction has 42294 states and 56602 transitions. [2018-12-02 14:43:14,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:43:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42294 states and 56602 transitions. [2018-12-02 14:43:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-12-02 14:43:14,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:14,405 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:14,405 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:14,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash 592145191, now seen corresponding path program 1 times [2018-12-02 14:43:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:14,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 82 proven. 14 refuted. 0 times theorem prover too weak. 1654 trivial. 0 not checked. [2018-12-02 14:43:14,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:14,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:43:14,554 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 722 with the following transitions: [2018-12-02 14:43:14,554 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [376], [377], [380], [382], [386], [388], [392], [394], [400], [404], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [590], [593], [599], [603], [606], [612], [616], [619], [622], [629], [632], [635], [638], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:43:14,555 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:43:14,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:43:16,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:43:16,031 INFO L272 AbstractInterpreter]: Visited 218 different actions 2168 times. Merged at 84 different actions 385 times. Widened at 1 different actions 1 times. Performed 24631 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24631 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 112 fixpoints after 27 different actions. Largest state had 66 variables. [2018-12-02 14:43:16,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:16,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:43:16,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:16,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:43:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:16,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:43:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:16,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:43:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2018-12-02 14:43:16,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:43:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 82 proven. 14 refuted. 0 times theorem prover too weak. 1654 trivial. 0 not checked. [2018-12-02 14:43:16,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:43:16,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-02 14:43:16,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:43:16,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:43:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:43:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:43:16,691 INFO L87 Difference]: Start difference. First operand 42294 states and 56602 transitions. Second operand 4 states. [2018-12-02 14:43:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:18,855 INFO L93 Difference]: Finished difference Result 64122 states and 86785 transitions. [2018-12-02 14:43:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:43:18,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 721 [2018-12-02 14:43:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:18,905 INFO L225 Difference]: With dead ends: 64122 [2018-12-02 14:43:18,905 INFO L226 Difference]: Without dead ends: 23809 [2018-12-02 14:43:18,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1450 GetRequests, 1443 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:43:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23809 states. [2018-12-02 14:43:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23809 to 21885. [2018-12-02 14:43:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21885 states. [2018-12-02 14:43:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 27958 transitions. [2018-12-02 14:43:20,598 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 27958 transitions. Word has length 721 [2018-12-02 14:43:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 21885 states and 27958 transitions. [2018-12-02 14:43:20,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:43:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 27958 transitions. [2018-12-02 14:43:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-12-02 14:43:20,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:20,606 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:20,606 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:20,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 90123592, now seen corresponding path program 1 times [2018-12-02 14:43:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:20,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2018-12-02 14:43:20,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:20,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:43:20,761 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 714 with the following transitions: [2018-12-02 14:43:20,761 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [359], [364], [369], [374], [376], [377], [380], [382], [386], [388], [392], [394], [400], [404], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [593], [603], [606], [609], [616], [619], [622], [629], [632], [635], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:43:20,762 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:43:20,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:43:26,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:43:26,863 INFO L272 AbstractInterpreter]: Visited 250 different actions 20267 times. Merged at 114 different actions 4140 times. Widened at 2 different actions 2 times. Performed 218504 root evaluator evaluations with a maximum evaluation depth of 3. Performed 218504 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1116 fixpoints after 39 different actions. Largest state had 66 variables. [2018-12-02 14:43:26,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:26,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:43:26,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:26,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:43:26,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:26,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:43:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:27,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:43:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 954 proven. 11 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2018-12-02 14:43:27,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:43:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1608 trivial. 0 not checked. [2018-12-02 14:43:27,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:43:27,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-12-02 14:43:27,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:43:27,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:43:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:43:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:43:27,618 INFO L87 Difference]: Start difference. First operand 21885 states and 27958 transitions. Second operand 5 states. [2018-12-02 14:43:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:30,825 INFO L93 Difference]: Finished difference Result 58257 states and 75750 transitions. [2018-12-02 14:43:30,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:43:30,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 713 [2018-12-02 14:43:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:30,912 INFO L225 Difference]: With dead ends: 58257 [2018-12-02 14:43:30,912 INFO L226 Difference]: Without dead ends: 40069 [2018-12-02 14:43:30,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1413 SyntacticMatches, 10 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:43:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40069 states. [2018-12-02 14:43:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40069 to 40013. [2018-12-02 14:43:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2018-12-02 14:43:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 51757 transitions. [2018-12-02 14:43:33,978 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 51757 transitions. Word has length 713 [2018-12-02 14:43:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:33,978 INFO L480 AbstractCegarLoop]: Abstraction has 40013 states and 51757 transitions. [2018-12-02 14:43:33,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:43:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 51757 transitions. [2018-12-02 14:43:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-12-02 14:43:33,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:33,987 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:33,987 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:33,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1363263098, now seen corresponding path program 1 times [2018-12-02 14:43:33,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:33,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:33,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2018-12-02 14:43:34,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:34,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:43:34,135 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 714 with the following transitions: [2018-12-02 14:43:34,135 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [359], [364], [369], [374], [376], [377], [382], [386], [388], [392], [394], [400], [404], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [593], [603], [606], [609], [616], [619], [622], [629], [632], [635], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:43:34,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:43:34,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:43:38,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:43:38,845 INFO L272 AbstractInterpreter]: Visited 249 different actions 15500 times. Merged at 115 different actions 3232 times. Widened at 2 different actions 2 times. Performed 171786 root evaluator evaluations with a maximum evaluation depth of 3. Performed 171786 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 839 fixpoints after 39 different actions. Largest state had 66 variables. [2018-12-02 14:43:38,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:38,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:43:38,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:38,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:43:38,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:38,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:43:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:39,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:43:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 954 proven. 9 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-12-02 14:43:39,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:43:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 1610 trivial. 0 not checked. [2018-12-02 14:43:39,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:43:39,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-12-02 14:43:39,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:43:39,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:43:39,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:43:39,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:43:39,681 INFO L87 Difference]: Start difference. First operand 40013 states and 51757 transitions. Second operand 5 states. [2018-12-02 14:43:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:42,877 INFO L93 Difference]: Finished difference Result 76329 states and 99546 transitions. [2018-12-02 14:43:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:43:42,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 713 [2018-12-02 14:43:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:42,963 INFO L225 Difference]: With dead ends: 76329 [2018-12-02 14:43:42,963 INFO L226 Difference]: Without dead ends: 40013 [2018-12-02 14:43:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1413 SyntacticMatches, 10 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:43:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40013 states. [2018-12-02 14:43:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40013 to 40013. [2018-12-02 14:43:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2018-12-02 14:43:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 51627 transitions. [2018-12-02 14:43:46,142 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 51627 transitions. Word has length 713 [2018-12-02 14:43:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:46,142 INFO L480 AbstractCegarLoop]: Abstraction has 40013 states and 51627 transitions. [2018-12-02 14:43:46,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:43:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 51627 transitions. [2018-12-02 14:43:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2018-12-02 14:43:46,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:46,151 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:46,151 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:46,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 815253071, now seen corresponding path program 1 times [2018-12-02 14:43:46,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:46,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 105 proven. 112 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-12-02 14:43:46,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:46,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:43:46,287 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 666 with the following transitions: [2018-12-02 14:43:46,287 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [359], [364], [369], [374], [376], [377], [382], [386], [388], [394], [400], [404], [406], [412], [418], [424], [430], [436], [438], [439], [442], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [593], [596], [603], [606], [609], [612], [616], [619], [625], [629], [632], [635], [638], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:43:46,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:43:46,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:43:52,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:43:52,752 INFO L272 AbstractInterpreter]: Visited 250 different actions 21822 times. Merged at 114 different actions 4460 times. Widened at 2 different actions 2 times. Performed 235631 root evaluator evaluations with a maximum evaluation depth of 3. Performed 235631 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1471 fixpoints after 43 different actions. Largest state had 66 variables. [2018-12-02 14:43:52,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:52,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:43:52,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:43:52,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:43:52,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:52,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:43:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:43:52,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:43:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 769 proven. 10 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2018-12-02 14:43:53,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:43:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2018-12-02 14:43:53,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:43:53,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 8 [2018-12-02 14:43:53,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:43:53,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:43:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:43:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:43:53,488 INFO L87 Difference]: Start difference. First operand 40013 states and 51627 transitions. Second operand 5 states. [2018-12-02 14:43:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:43:56,713 INFO L93 Difference]: Finished difference Result 76329 states and 99328 transitions. [2018-12-02 14:43:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:43:56,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 665 [2018-12-02 14:43:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:43:56,797 INFO L225 Difference]: With dead ends: 76329 [2018-12-02 14:43:56,797 INFO L226 Difference]: Without dead ends: 40013 [2018-12-02 14:43:56,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 1326 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:43:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40013 states. [2018-12-02 14:43:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40013 to 40013. [2018-12-02 14:43:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2018-12-02 14:43:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 51455 transitions. [2018-12-02 14:43:59,904 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 51455 transitions. Word has length 665 [2018-12-02 14:43:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:43:59,904 INFO L480 AbstractCegarLoop]: Abstraction has 40013 states and 51455 transitions. [2018-12-02 14:43:59,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:43:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 51455 transitions. [2018-12-02 14:43:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-12-02 14:43:59,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:43:59,913 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:43:59,913 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:43:59,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:43:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash -316688058, now seen corresponding path program 1 times [2018-12-02 14:43:59,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:43:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:43:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:43:59,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:43:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2018-12-02 14:44:00,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:44:00,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:44:00,118 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 714 with the following transitions: [2018-12-02 14:44:00,118 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [359], [364], [369], [374], [376], [377], [382], [388], [394], [400], [404], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [593], [603], [606], [609], [616], [619], [622], [629], [632], [635], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:44:00,119 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:44:00,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:44:03,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:44:03,598 INFO L272 AbstractInterpreter]: Visited 247 different actions 11953 times. Merged at 106 different actions 2448 times. Widened at 1 different actions 1 times. Performed 126152 root evaluator evaluations with a maximum evaluation depth of 3. Performed 126152 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 655 fixpoints after 38 different actions. Largest state had 66 variables. [2018-12-02 14:44:03,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:03,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:44:03,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:44:03,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:44:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:03,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:44:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:03,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:44:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 954 proven. 7 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-12-02 14:44:03,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:44:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 1612 trivial. 0 not checked. [2018-12-02 14:44:04,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:44:04,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-12-02 14:44:04,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:44:04,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:44:04,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:44:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:44:04,332 INFO L87 Difference]: Start difference. First operand 40013 states and 51455 transitions. Second operand 5 states. [2018-12-02 14:44:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:44:07,572 INFO L93 Difference]: Finished difference Result 76329 states and 98942 transitions. [2018-12-02 14:44:07,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:44:07,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 713 [2018-12-02 14:44:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:44:07,655 INFO L225 Difference]: With dead ends: 76329 [2018-12-02 14:44:07,655 INFO L226 Difference]: Without dead ends: 40013 [2018-12-02 14:44:07,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1413 SyntacticMatches, 10 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:44:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40013 states. [2018-12-02 14:44:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40013 to 40013. [2018-12-02 14:44:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2018-12-02 14:44:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 51325 transitions. [2018-12-02 14:44:10,835 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 51325 transitions. Word has length 713 [2018-12-02 14:44:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:44:10,836 INFO L480 AbstractCegarLoop]: Abstraction has 40013 states and 51325 transitions. [2018-12-02 14:44:10,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:44:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 51325 transitions. [2018-12-02 14:44:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-12-02 14:44:10,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:44:10,844 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:44:10,844 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:44:10,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1396612228, now seen corresponding path program 1 times [2018-12-02 14:44:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:44:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:10,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:44:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2018-12-02 14:44:10,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:44:10,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:44:10,995 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 714 with the following transitions: [2018-12-02 14:44:10,995 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [89], [91], [94], [105], [107], [109], [111], [115], [116], [121], [124], [126], [129], [133], [134], [135], [138], [141], [143], [145], [147], [149], [150], [155], [161], [167], [173], [179], [185], [191], [197], [203], [209], [211], [212], [215], [218], [220], [222], [224], [226], [227], [289], [292], [295], [297], [299], [301], [303], [304], [305], [307], [310], [312], [315], [318], [320], [323], [326], [328], [331], [334], [336], [339], [342], [344], [346], [348], [349], [352], [354], [357], [359], [364], [369], [374], [376], [377], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [442], [445], [447], [449], [451], [453], [454], [457], [463], [469], [475], [481], [485], [486], [489], [491], [494], [505], [507], [509], [513], [551], [554], [555], [556], [565], [568], [571], [573], [577], [580], [583], [586], [590], [593], [603], [606], [609], [616], [619], [622], [629], [632], [635], [643], [644], [647], [650], [652], [654], [656], [658], [659], [660], [674], [676], [678], [680], [685], [693], [696], [701], [706], [710], [711], [712], [713], [714], [715], [716], [717], [718], [719], [720], [721], [722], [724], [725], [726], [727], [728], [729], [730], [731], [732], [733], [734], [735], [736], [737], [738], [739], [740], [744], [745], [746], [747], [748], [749], [750], [751], [752], [753], [754], [755], [756], [757], [758], [759], [760], [761], [762], [763], [764], [765], [766], [767], [768], [769], [770], [771], [772], [773], [774], [775], [776], [777], [784], [785], [786], [787], [788] [2018-12-02 14:44:10,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:44:10,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:44:17,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:44:17,151 INFO L272 AbstractInterpreter]: Visited 246 different actions 18853 times. Merged at 106 different actions 3799 times. Widened at 2 different actions 2 times. Performed 189726 root evaluator evaluations with a maximum evaluation depth of 3. Performed 189726 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1037 fixpoints after 38 different actions. Largest state had 66 variables. [2018-12-02 14:44:17,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:17,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:44:17,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:44:17,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:44:17,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:17,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:44:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:17,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:44:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2018-12-02 14:44:17,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:44:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 1507 trivial. 0 not checked. [2018-12-02 14:44:17,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:44:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-12-02 14:44:17,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:44:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:44:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:44:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:44:17,807 INFO L87 Difference]: Start difference. First operand 40013 states and 51325 transitions. Second operand 6 states. [2018-12-02 14:44:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:44:18,580 INFO L93 Difference]: Finished difference Result 44950 states and 56947 transitions. [2018-12-02 14:44:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:44:18,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 713 [2018-12-02 14:44:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:44:18,593 INFO L225 Difference]: With dead ends: 44950 [2018-12-02 14:44:18,594 INFO L226 Difference]: Without dead ends: 3249 [2018-12-02 14:44:18,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1423 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:44:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2018-12-02 14:44:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3170. [2018-12-02 14:44:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2018-12-02 14:44:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 3409 transitions. [2018-12-02 14:44:18,897 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 3409 transitions. Word has length 713 [2018-12-02 14:44:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:44:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 3170 states and 3409 transitions. [2018-12-02 14:44:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:44:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 3409 transitions. [2018-12-02 14:44:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-12-02 14:44:18,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:44:18,900 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:44:18,900 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:44:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1235656365, now seen corresponding path program 1 times [2018-12-02 14:44:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:44:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:18,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:44:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-12-02 14:44:19,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:44:19,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:44:19,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:44:19,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:44:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:44:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:44:19,086 INFO L87 Difference]: Start difference. First operand 3170 states and 3409 transitions. Second operand 9 states. [2018-12-02 14:44:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:44:20,620 INFO L93 Difference]: Finished difference Result 3174 states and 3414 transitions. [2018-12-02 14:44:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 14:44:20,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 505 [2018-12-02 14:44:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:44:20,624 INFO L225 Difference]: With dead ends: 3174 [2018-12-02 14:44:20,624 INFO L226 Difference]: Without dead ends: 3171 [2018-12-02 14:44:20,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:44:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2018-12-02 14:44:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3169. [2018-12-02 14:44:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3169 states. [2018-12-02 14:44:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 3406 transitions. [2018-12-02 14:44:20,887 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 3406 transitions. Word has length 505 [2018-12-02 14:44:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:44:20,887 INFO L480 AbstractCegarLoop]: Abstraction has 3169 states and 3406 transitions. [2018-12-02 14:44:20,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:44:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 3406 transitions. [2018-12-02 14:44:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-12-02 14:44:20,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:44:20,890 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:44:20,890 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:44:20,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash 225743509, now seen corresponding path program 1 times [2018-12-02 14:44:20,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:44:20,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:20,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:44:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:44:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2018-12-02 14:44:20,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:44:20,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:44:20,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:44:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:44:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:44:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:44:20,978 INFO L87 Difference]: Start difference. First operand 3169 states and 3406 transitions. Second operand 3 states. [2018-12-02 14:44:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:44:21,247 INFO L93 Difference]: Finished difference Result 4698 states and 5078 transitions. [2018-12-02 14:44:21,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:44:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2018-12-02 14:44:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:44:21,254 INFO L225 Difference]: With dead ends: 4698 [2018-12-02 14:44:21,254 INFO L226 Difference]: Without dead ends: 3183 [2018-12-02 14:44:21,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:44:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2018-12-02 14:44:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3177. [2018-12-02 14:44:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3177 states. [2018-12-02 14:44:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3416 transitions. [2018-12-02 14:44:21,518 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3416 transitions. Word has length 509 [2018-12-02 14:44:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:44:21,519 INFO L480 AbstractCegarLoop]: Abstraction has 3177 states and 3416 transitions. [2018-12-02 14:44:21,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:44:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3416 transitions. [2018-12-02 14:44:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-12-02 14:44:21,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:44:21,521 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:44:21,521 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:44:21,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:44:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash -362680597, now seen corresponding path program 1 times [2018-12-02 14:44:21,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:44:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:21,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:44:21,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:44:21,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:44:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:44:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:44:21,671 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:44:21,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:44:21 BoogieIcfgContainer [2018-12-02 14:44:21,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:44:21,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:44:21,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:44:21,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:44:21,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:33:55" (3/4) ... [2018-12-02 14:44:21,859 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:44:22,048 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e7748f07-95d9-49dc-9466-54c0bba0d136/bin-2019/utaipan/witness.graphml [2018-12-02 14:44:22,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:44:22,049 INFO L168 Benchmark]: Toolchain (without parser) took 627442.94 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 952.4 MB in the beginning and 5.7 GB in the end (delta: -4.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,050 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:44:22,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,051 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:44:22,051 INFO L168 Benchmark]: RCFGBuilder took 353.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,051 INFO L168 Benchmark]: TraceAbstraction took 626628.08 ms. Allocated memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: 5.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -850.2 MB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,051 INFO L168 Benchmark]: Witness Printer took 191.88 ms. Allocated memory was 6.7 GB in the beginning and 6.8 GB in the end (delta: 100.1 MB). Free memory was 1.9 GB in the beginning and 5.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:44:22,053 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 626628.08 ms. Allocated memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: 5.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -850.2 MB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 191.88 ms. Allocated memory was 6.7 GB in the beginning and 6.8 GB in the end (delta: 100.1 MB). Free memory was 1.9 GB in the beginning and 5.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int t4_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int t3_st ; [L23] int t4_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int t4_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int T4_E = 2; [L34] int E_M = 2; [L35] int E_1 = 2; [L36] int E_2 = 2; [L37] int E_3 = 2; [L38] int E_4 = 2; [L45] int token ; [L47] int local ; VAL [\old(E_1)=28, \old(E_2)=20, \old(E_3)=19, \old(E_4)=9, \old(E_M)=14, \old(local)=27, \old(M_E)=15, \old(m_i)=8, \old(m_pc)=24, \old(m_st)=13, \old(T1_E)=5, \old(t1_i)=25, \old(t1_pc)=23, \old(t1_st)=6, \old(T2_E)=26, \old(t2_i)=7, \old(t2_pc)=22, \old(t2_st)=11, \old(T3_E)=18, \old(t3_i)=30, \old(t3_pc)=21, \old(t3_st)=12, \old(T4_E)=31, \old(t4_i)=16, \old(t4_pc)=17, \old(t4_st)=10, \old(token)=29, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L850] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L854] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L762] m_i = 1 [L763] t1_i = 1 [L764] t2_i = 1 [L765] t3_i = 1 [L766] t4_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L854] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L855] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L791] int kernel_st ; [L792] int tmp ; [L793] int tmp___0 ; [L797] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L798] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L799] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L355] COND TRUE m_i == 1 [L356] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L360] COND TRUE t1_i == 1 [L361] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L365] COND TRUE t2_i == 1 [L366] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L370] COND TRUE t3_i == 1 [L371] t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L375] COND TRUE t4_i == 1 [L376] t4_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L799] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L800] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L516] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L521] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L526] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L531] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L536] COND FALSE !(T4_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L541] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L546] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L551] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L556] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L561] COND FALSE !(E_4 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L800] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L801] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L252] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L262] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, token=0] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L271] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L281] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, token=0] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, token=0] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L290] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L300] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, token=0] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L309] COND FALSE !(t3_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L319] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L328] COND FALSE !(t4_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L338] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit4_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, token=0] [L801] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L802] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L574] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L579] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L584] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L589] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L594] COND FALSE !(T4_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L599] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L604] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L609] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L614] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L619] COND FALSE !(E_4 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L802] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L805] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L808] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L809] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L421] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L425] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L428] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L385] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L416] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L428] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, token=0] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L455] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L108] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L119] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L121] t1_pc = 1 [L122] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L455] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L469] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L144] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L155] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L157] t2_pc = 1 [L158] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L469] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L483] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L180] COND TRUE t3_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L193] t3_pc = 1 [L194] t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L483] RET transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L497] CALL transmit4() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L216] COND TRUE t4_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L227] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L229] t4_pc = 1 [L230] t4_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L497] RET transmit4() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L425] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L428] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L385] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L416] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L428] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L441] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=0, token=0] [L63] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=0, token=0] [L66] token = __VERIFIER_nondet_int() [L67] local = token [L68] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=0, token=0] [L69] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L685] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L252] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L262] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=0] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L271] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L272] COND TRUE E_1 == 1 [L273] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=0] [L645] tmp___0 = is_transmit1_triggered() [L647] COND TRUE \read(tmp___0) [L648] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, token=0] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L290] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L291] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L300] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, token=0] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L309] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L310] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L319] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L328] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L329] COND FALSE !(E_4 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L338] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, is_transmit4_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, tmp___3=0, token=0] [L685] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L69] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=0, token=0] [L70] E_1 = 2 [L71] m_pc = 1 [L72] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=0, token=0] [L441] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=0] [L455] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L108] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L111] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L127] token += 1 [L128] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L129] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L685] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L252] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L253] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L262] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=1] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L271] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L272] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L281] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=1] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=1] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L290] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L291] COND TRUE E_2 == 1 [L292] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=1, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, is_transmit2_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=1] [L653] tmp___1 = is_transmit2_triggered() [L655] COND TRUE \read(tmp___1) [L656] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L309] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L310] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L319] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L328] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L329] COND FALSE !(E_4 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L338] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, is_transmit4_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, tmp___3=0, token=1] [L685] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L129] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L130] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L119] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L121] t1_pc = 1 [L122] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L455] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=1] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=1] [L469] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L144] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L147] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L163] token += 1 [L164] E_3 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L165] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L685] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L252] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L253] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L262] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=2] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L271] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L272] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L281] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=2] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=2] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L290] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L291] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L300] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=2] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L309] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L310] COND TRUE E_3 == 1 [L311] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, __retres1=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, is_transmit3_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L661] tmp___2 = is_transmit3_triggered() [L663] COND TRUE \read(tmp___2) [L664] t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L328] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L329] COND FALSE !(E_4 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L338] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, is_transmit4_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, tmp___3=0, token=2] [L685] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L165] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L166] E_3 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L155] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L157] t2_pc = 1 [L158] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L469] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=2] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=2] [L483] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L180] COND FALSE !(t3_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L183] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L199] token += 1 [L200] E_4 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L201] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L685] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L252] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L253] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L262] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=3] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L271] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L272] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L281] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, token=3] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=3] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L290] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L291] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L300] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, token=3] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, token=3] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L309] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L310] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L319] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, token=3] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L328] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L329] COND TRUE E_4 == 1 [L330] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, is_transmit4_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L669] tmp___3 = is_transmit4_triggered() [L671] COND TRUE \read(tmp___3) [L672] t4_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=1, token=3] [L685] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L201] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L202] E_4 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L193] t3_pc = 1 [L194] t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=2, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L483] RET transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=3] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=3] [L497] CALL transmit4() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L216] COND FALSE !(t4_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L219] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L235] token += 1 [L236] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L237] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L685] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L637] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L249] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L252] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L253] COND TRUE E_M == 1 [L254] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L264] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L637] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L637] tmp = is_master_triggered() [L639] COND TRUE \read(tmp) [L640] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, token=4] [L645] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L268] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L271] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L272] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L281] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L283] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L645] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, token=4] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, token=4] [L653] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L287] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L290] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L291] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L300] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L302] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L653] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, token=4] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, tmp___1=0, token=4] [L661] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L306] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L309] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L310] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L319] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L321] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L661] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, tmp___1=0, token=4] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=4] [L669] CALL, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L325] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L328] COND TRUE t4_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L329] COND FALSE !(E_4 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L338] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L340] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L669] RET, EXPR is_transmit4_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, is_transmit4_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=4] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, token=4] [L685] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L237] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L238] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L227] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L229] t4_pc = 1 [L230] t4_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=1, \old(t4_st)=1, \old(token)=3, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L497] RET transmit4() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=4] [L425] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=4] [L428] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L385] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L416] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L428] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=4] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=4] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, tmp_ndt_5=1, token=4] [L441] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L55] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L77] COND FALSE !(token != local + 4) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L82] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L83] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L88] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L89] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L90] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, tmp_var=5, token=4] [L91] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_4)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(T4_E)=2, \old(t4_i)=0, \old(t4_pc)=0, \old(t4_st)=2, \old(token)=4, E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 241 locations, 1 error locations. UNSAFE Result, 626.5s OverallTime, 63 OverallIterations, 8 TraceHistogramMax, 457.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27356 SDtfs, 50045 SDslu, 196810 SDs, 0 SdLazy, 101513 SolverSat, 15676 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.1s Time, PredicateUnifierStatistics: 40 DeclaredPredicates, 27499 GetRequests, 24020 SyntacticMatches, 145 SemanticMatches, 3334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184703 ImplicationChecksByTransitivity, 81.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89894occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 34.0s AbstIntTime, 43 AbstIntIterations, 20 AbstIntStrong, 0.9930660777430895 AbsIntWeakeningRatio, 0.6347578347578348 AbsIntAvgWeakeningVarsNumRemoved, 26.03741690408357 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 85.3s AutomataMinimizationTime, 62 MinimizatonAttempts, 32615 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 29813 NumberOfCodeBlocks, 29813 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 39285 ConstructedInterpolants, 0 QuantifiedInterpolants, 23855443 SizeOfPredicates, 35 NumberOfNonLiveVariables, 43077 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 108 InterpolantComputations, 46 PerfectInterpolantSequences, 51549/52975 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...