./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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 69fb30bd96659b6c61b59030d7ea8c3053fedc35 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 12:13:44,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:13:44,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:13:44,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:13:44,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:13:44,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:13:44,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:13:44,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:13:44,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:13:44,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:13:44,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:13:44,788 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:13:44,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:13:44,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:13:44,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:13:44,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:13:44,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:13:44,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:13:44,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:13:44,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:13:44,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:13:44,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:13:44,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:13:44,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:13:44,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:13:44,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:13:44,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:13:44,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:13:44,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:13:44,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:13:44,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:13:44,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:13:44,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:13:44,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:13:44,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:13:44,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:13:44,803 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:13:44,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:13:44,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:13:44,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:13:44,814 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:13:44,814 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:13:44,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:13:44,814 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:13:44,814 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:13:44,814 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:13:44,815 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:13:44,815 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:13:44,815 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:13:44,815 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:13:44,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:13:44,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:13:44,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:13:44,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:13:44,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:13:44,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:13:44,818 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:13:44,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:13:44,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:13:44,818 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:13:44,818 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_d8c6d453-1b74-4cd4-8015-49e2638ca777/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 -> 69fb30bd96659b6c61b59030d7ea8c3053fedc35 [2018-11-18 12:13:44,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:13:44,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:13:44,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:13:44,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:13:44,853 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:13:44,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c [2018-11-18 12:13:44,892 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/data/05aa145a8/1570b70d87974e98a036e2088ff5c21e/FLAG5445d2164 [2018-11-18 12:13:45,296 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:13:45,297 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/sv-benchmarks/c/systemc/token_ring.03_false-unreach-call_false-termination.cil.c [2018-11-18 12:13:45,302 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/data/05aa145a8/1570b70d87974e98a036e2088ff5c21e/FLAG5445d2164 [2018-11-18 12:13:45,312 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/data/05aa145a8/1570b70d87974e98a036e2088ff5c21e [2018-11-18 12:13:45,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:13:45,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:13:45,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:45,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:13:45,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:13:45,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e3deec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45, skipping insertion in model container [2018-11-18 12:13:45,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:13:45,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:13:45,495 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:45,499 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:13:45,534 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:45,546 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:13:45,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45 WrapperNode [2018-11-18 12:13:45,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:45,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:45,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:13:45,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:13:45,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:45,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:13:45,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:13:45,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:13:45,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... [2018-11-18 12:13:45,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:13:45,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:13:45,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:13:45,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:13:45,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:13:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 12:13:45,664 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 12:13:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2018-11-18 12:13:45,664 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2018-11-18 12:13:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-18 12:13:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-18 12:13:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:13:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:13:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 12:13:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 12:13:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 12:13:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 12:13:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-18 12:13:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-18 12:13:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 12:13:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 12:13:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 12:13:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 12:13:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 12:13:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 12:13:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 12:13:45,666 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 12:13:45,666 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 12:13:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 12:13:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 12:13:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 12:13:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 12:13:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 12:13:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 12:13:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 12:13:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 12:13:45,667 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 12:13:45,667 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 12:13:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 12:13:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 12:13:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 12:13:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:13:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:13:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 12:13:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 12:13:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2018-11-18 12:13:45,668 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2018-11-18 12:13:45,668 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 12:13:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 12:13:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 12:13:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 12:13:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:13:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:13:45,669 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 12:13:45,669 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 12:13:46,057 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:13:46,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:46 BoogieIcfgContainer [2018-11-18 12:13:46,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:13:46,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:13:46,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:13:46,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:13:46,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:13:45" (1/3) ... [2018-11-18 12:13:46,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df3573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:13:46, skipping insertion in model container [2018-11-18 12:13:46,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:45" (2/3) ... [2018-11-18 12:13:46,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df3573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:13:46, skipping insertion in model container [2018-11-18 12:13:46,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:46" (3/3) ... [2018-11-18 12:13:46,064 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03_false-unreach-call_false-termination.cil.c [2018-11-18 12:13:46,072 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:13:46,079 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:13:46,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:13:46,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:13:46,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:13:46,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:13:46,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:13:46,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:13:46,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:13:46,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:13:46,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:13:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states. [2018-11-18 12:13:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:46,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:46,150 INFO L375 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] [2018-11-18 12:13:46,152 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:46,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash 690813036, now seen corresponding path program 1 times [2018-11-18 12:13:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:46,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:46,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:46,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:46,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:46,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:13:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:13:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:13:46,366 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 4 states. [2018-11-18 12:13:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:46,555 INFO L93 Difference]: Finished difference Result 417 states and 607 transitions. [2018-11-18 12:13:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:13:46,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-18 12:13:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:46,568 INFO L225 Difference]: With dead ends: 417 [2018-11-18 12:13:46,568 INFO L226 Difference]: Without dead ends: 208 [2018-11-18 12:13:46,572 INFO L604 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-11-18 12:13:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-18 12:13:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-11-18 12:13:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2018-11-18 12:13:46,618 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 108 [2018-11-18 12:13:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:46,619 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2018-11-18 12:13:46,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:13:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2018-11-18 12:13:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:46,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:46,623 INFO L375 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] [2018-11-18 12:13:46,623 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:46,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash 719313326, now seen corresponding path program 1 times [2018-11-18 12:13:46,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:46,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:46,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:46,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:46,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:46,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:46,768 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand 5 states. [2018-11-18 12:13:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:47,095 INFO L93 Difference]: Finished difference Result 430 states and 610 transitions. [2018-11-18 12:13:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:47,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:47,097 INFO L225 Difference]: With dead ends: 430 [2018-11-18 12:13:47,098 INFO L226 Difference]: Without dead ends: 243 [2018-11-18 12:13:47,099 INFO L604 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-11-18 12:13:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-18 12:13:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 208. [2018-11-18 12:13:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2018-11-18 12:13:47,122 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 108 [2018-11-18 12:13:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2018-11-18 12:13:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2018-11-18 12:13:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:47,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:47,124 INFO L375 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] [2018-11-18 12:13:47,125 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:47,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1159817620, now seen corresponding path program 1 times [2018-11-18 12:13:47,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:47,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:47,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:47,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:47,203 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand 5 states. [2018-11-18 12:13:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:47,499 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2018-11-18 12:13:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:47,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:47,501 INFO L225 Difference]: With dead ends: 428 [2018-11-18 12:13:47,502 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 12:13:47,503 INFO L604 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-11-18 12:13:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 12:13:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 208. [2018-11-18 12:13:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 284 transitions. [2018-11-18 12:13:47,521 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 284 transitions. Word has length 108 [2018-11-18 12:13:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:47,521 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 284 transitions. [2018-11-18 12:13:47,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 284 transitions. [2018-11-18 12:13:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:47,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:47,523 INFO L375 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] [2018-11-18 12:13:47,523 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:47,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash 165038574, now seen corresponding path program 1 times [2018-11-18 12:13:47,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:47,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:47,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:47,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:47,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:47,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:47,583 INFO L87 Difference]: Start difference. First operand 208 states and 284 transitions. Second operand 5 states. [2018-11-18 12:13:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:47,848 INFO L93 Difference]: Finished difference Result 426 states and 598 transitions. [2018-11-18 12:13:47,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:47,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:47,851 INFO L225 Difference]: With dead ends: 426 [2018-11-18 12:13:47,851 INFO L226 Difference]: Without dead ends: 239 [2018-11-18 12:13:47,852 INFO L604 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-11-18 12:13:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-18 12:13:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 208. [2018-11-18 12:13:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 283 transitions. [2018-11-18 12:13:47,867 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 283 transitions. Word has length 108 [2018-11-18 12:13:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:47,867 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 283 transitions. [2018-11-18 12:13:47,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 283 transitions. [2018-11-18 12:13:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:47,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:47,868 INFO L375 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] [2018-11-18 12:13:47,869 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:47,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1731796524, now seen corresponding path program 1 times [2018-11-18 12:13:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:47,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:47,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:47,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:47,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:47,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:47,924 INFO L87 Difference]: Start difference. First operand 208 states and 283 transitions. Second operand 5 states. [2018-11-18 12:13:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:48,227 INFO L93 Difference]: Finished difference Result 448 states and 632 transitions. [2018-11-18 12:13:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:48,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:48,229 INFO L225 Difference]: With dead ends: 448 [2018-11-18 12:13:48,230 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 12:13:48,230 INFO L604 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-11-18 12:13:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 12:13:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 208. [2018-11-18 12:13:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 282 transitions. [2018-11-18 12:13:48,248 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 282 transitions. Word has length 108 [2018-11-18 12:13:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:48,249 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 282 transitions. [2018-11-18 12:13:48,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 282 transitions. [2018-11-18 12:13:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:48,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:48,250 INFO L375 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] [2018-11-18 12:13:48,250 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:48,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 673958446, now seen corresponding path program 1 times [2018-11-18 12:13:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:48,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:48,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:48,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:48,301 INFO L87 Difference]: Start difference. First operand 208 states and 282 transitions. Second operand 5 states. [2018-11-18 12:13:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:48,554 INFO L93 Difference]: Finished difference Result 441 states and 620 transitions. [2018-11-18 12:13:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:48,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:48,556 INFO L225 Difference]: With dead ends: 441 [2018-11-18 12:13:48,556 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 12:13:48,557 INFO L604 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-11-18 12:13:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 12:13:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 208. [2018-11-18 12:13:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 281 transitions. [2018-11-18 12:13:48,569 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 281 transitions. Word has length 108 [2018-11-18 12:13:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:48,570 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 281 transitions. [2018-11-18 12:13:48,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2018-11-18 12:13:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:48,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:48,571 INFO L375 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] [2018-11-18 12:13:48,571 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:48,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash -468544020, now seen corresponding path program 1 times [2018-11-18 12:13:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:48,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:48,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:48,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:48,636 INFO L87 Difference]: Start difference. First operand 208 states and 281 transitions. Second operand 5 states. [2018-11-18 12:13:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:48,864 INFO L93 Difference]: Finished difference Result 444 states and 620 transitions. [2018-11-18 12:13:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:48,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:48,866 INFO L225 Difference]: With dead ends: 444 [2018-11-18 12:13:48,866 INFO L226 Difference]: Without dead ends: 257 [2018-11-18 12:13:48,866 INFO L604 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-11-18 12:13:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-18 12:13:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 208. [2018-11-18 12:13:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2018-11-18 12:13:48,879 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 108 [2018-11-18 12:13:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:48,879 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2018-11-18 12:13:48,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2018-11-18 12:13:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:48,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:48,880 INFO L375 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] [2018-11-18 12:13:48,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:48,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash -228304274, now seen corresponding path program 1 times [2018-11-18 12:13:48,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:48,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:48,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:48,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:48,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:48,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:48,924 INFO L87 Difference]: Start difference. First operand 208 states and 280 transitions. Second operand 5 states. [2018-11-18 12:13:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:49,190 INFO L93 Difference]: Finished difference Result 442 states and 614 transitions. [2018-11-18 12:13:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:13:49,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-18 12:13:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:49,191 INFO L225 Difference]: With dead ends: 442 [2018-11-18 12:13:49,191 INFO L226 Difference]: Without dead ends: 255 [2018-11-18 12:13:49,192 INFO L604 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-11-18 12:13:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-18 12:13:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2018-11-18 12:13:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 12:13:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2018-11-18 12:13:49,212 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 108 [2018-11-18 12:13:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:49,213 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2018-11-18 12:13:49,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2018-11-18 12:13:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 12:13:49,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:49,214 INFO L375 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] [2018-11-18 12:13:49,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:49,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 610729388, now seen corresponding path program 1 times [2018-11-18 12:13:49,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:49,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:49,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:49,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:49,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:49,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:13:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:13:49,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:13:49,305 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand 4 states. [2018-11-18 12:13:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:49,515 INFO L93 Difference]: Finished difference Result 566 states and 789 transitions. [2018-11-18 12:13:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:13:49,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-18 12:13:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:49,518 INFO L225 Difference]: With dead ends: 566 [2018-11-18 12:13:49,518 INFO L226 Difference]: Without dead ends: 380 [2018-11-18 12:13:49,519 INFO L604 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-11-18 12:13:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-18 12:13:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2018-11-18 12:13:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-18 12:13:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 505 transitions. [2018-11-18 12:13:49,552 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 505 transitions. Word has length 108 [2018-11-18 12:13:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:49,552 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 505 transitions. [2018-11-18 12:13:49,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:13:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 505 transitions. [2018-11-18 12:13:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 12:13:49,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:49,554 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:13:49,554 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:49,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1288067643, now seen corresponding path program 1 times [2018-11-18 12:13:49,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:49,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:49,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 12:13:49,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:49,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:49,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-18 12:13:49,626 INFO L202 CegarAbsIntRunner]: [90], [95], [109], [112], [115], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [249], [252], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [301], [307], [313], [321], [325], [331], [337], [343], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [504], [517], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:13:49,656 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:49,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:49,804 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:13:49,805 INFO L272 AbstractInterpreter]: Visited 44 different actions 44 times. Never merged. Never widened. Performed 495 root evaluator evaluations with a maximum evaluation depth of 3. Performed 495 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:13:49,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:49,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:13:49,955 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 68.41% of their original sizes. [2018-11-18 12:13:49,955 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:13:50,023 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-18 12:13:50,023 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:13:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:13:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-18 12:13:50,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:50,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:13:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:13:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:13:50,024 INFO L87 Difference]: Start difference. First operand 379 states and 505 transitions. Second operand 11 states. [2018-11-18 12:13:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:51,213 INFO L93 Difference]: Finished difference Result 873 states and 1182 transitions. [2018-11-18 12:13:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:13:51,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2018-11-18 12:13:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:51,219 INFO L225 Difference]: With dead ends: 873 [2018-11-18 12:13:51,219 INFO L226 Difference]: Without dead ends: 510 [2018-11-18 12:13:51,220 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:13:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-18 12:13:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 496. [2018-11-18 12:13:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-18 12:13:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 645 transitions. [2018-11-18 12:13:51,267 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 645 transitions. Word has length 175 [2018-11-18 12:13:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:51,267 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 645 transitions. [2018-11-18 12:13:51,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:13:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 645 transitions. [2018-11-18 12:13:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 12:13:51,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:51,270 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:13:51,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:51,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -329391900, now seen corresponding path program 1 times [2018-11-18 12:13:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:51,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:51,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 12:13:51,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:51,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:51,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-18 12:13:51,353 INFO L202 CegarAbsIntRunner]: [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [504], [517], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:13:51,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:51,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:51,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:13:51,396 INFO L272 AbstractInterpreter]: Visited 54 different actions 54 times. Never merged. Never widened. Performed 554 root evaluator evaluations with a maximum evaluation depth of 3. Performed 554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:13:51,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:51,398 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:13:51,481 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 67.49% of their original sizes. [2018-11-18 12:13:51,482 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:13:51,607 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-18 12:13:51,607 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:13:51,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:13:51,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-18 12:13:51,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:51,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:13:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:13:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:13:51,608 INFO L87 Difference]: Start difference. First operand 496 states and 645 transitions. Second operand 16 states. [2018-11-18 12:13:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:53,384 INFO L93 Difference]: Finished difference Result 981 states and 1283 transitions. [2018-11-18 12:13:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:13:53,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2018-11-18 12:13:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:53,386 INFO L225 Difference]: With dead ends: 981 [2018-11-18 12:13:53,386 INFO L226 Difference]: Without dead ends: 507 [2018-11-18 12:13:53,387 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-11-18 12:13:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-18 12:13:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2018-11-18 12:13:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-18 12:13:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 636 transitions. [2018-11-18 12:13:53,417 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 636 transitions. Word has length 175 [2018-11-18 12:13:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 636 transitions. [2018-11-18 12:13:53,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:13:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 636 transitions. [2018-11-18 12:13:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 12:13:53,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:53,420 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:13:53,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:53,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1526454989, now seen corresponding path program 1 times [2018-11-18 12:13:53,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:53,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 12:13:53,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:53,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:53,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-18 12:13:53,480 INFO L202 CegarAbsIntRunner]: [32], [43], [49], [51], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [504], [517], [521], [524], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:13:53,482 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:53,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:53,506 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:13:53,506 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Performed 616 root evaluator evaluations with a maximum evaluation depth of 3. Performed 616 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:13:53,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:53,514 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:13:53,568 INFO L227 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 66.25% of their original sizes. [2018-11-18 12:13:53,569 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:13:53,744 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-18 12:13:53,744 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:13:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:13:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-18 12:13:53,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 12:13:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 12:13:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:13:53,746 INFO L87 Difference]: Start difference. First operand 493 states and 636 transitions. Second operand 20 states. [2018-11-18 12:13:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:56,704 INFO L93 Difference]: Finished difference Result 978 states and 1267 transitions. [2018-11-18 12:13:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 12:13:56,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-11-18 12:13:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:56,706 INFO L225 Difference]: With dead ends: 978 [2018-11-18 12:13:56,706 INFO L226 Difference]: Without dead ends: 507 [2018-11-18 12:13:56,708 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 12:13:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-18 12:13:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2018-11-18 12:13:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-18 12:13:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 634 transitions. [2018-11-18 12:13:56,753 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 634 transitions. Word has length 198 [2018-11-18 12:13:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:56,753 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 634 transitions. [2018-11-18 12:13:56,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 12:13:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 634 transitions. [2018-11-18 12:13:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 12:13:56,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:56,756 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:13:56,757 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:13:56,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash -690041089, now seen corresponding path program 1 times [2018-11-18 12:13:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:56,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:56,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-18 12:13:56,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:56,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:56,842 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-18 12:13:56,842 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [517], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:13:56,844 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:56,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:56,880 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:13:56,880 INFO L272 AbstractInterpreter]: Visited 75 different actions 75 times. Never merged. Never widened. Performed 675 root evaluator evaluations with a maximum evaluation depth of 3. Performed 675 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:13:56,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:56,882 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:13:56,950 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 64.83% of their original sizes. [2018-11-18 12:13:56,951 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:13:57,171 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-18 12:13:57,171 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:13:57,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:13:57,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-18 12:13:57,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:57,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 12:13:57,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 12:13:57,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-11-18 12:13:57,172 INFO L87 Difference]: Start difference. First operand 493 states and 634 transitions. Second operand 24 states. [2018-11-18 12:14:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:01,622 INFO L93 Difference]: Finished difference Result 978 states and 1263 transitions. [2018-11-18 12:14:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 12:14:01,623 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 198 [2018-11-18 12:14:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:01,625 INFO L225 Difference]: With dead ends: 978 [2018-11-18 12:14:01,625 INFO L226 Difference]: Without dead ends: 507 [2018-11-18 12:14:01,626 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 12:14:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-11-18 12:14:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2018-11-18 12:14:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-11-18 12:14:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 632 transitions. [2018-11-18 12:14:01,685 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 632 transitions. Word has length 198 [2018-11-18 12:14:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:01,685 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 632 transitions. [2018-11-18 12:14:01,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 12:14:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 632 transitions. [2018-11-18 12:14:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 12:14:01,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:01,688 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:14:01,688 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:01,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:01,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1274812739, now seen corresponding path program 1 times [2018-11-18 12:14:01,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:01,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:01,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 12:14:01,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:01,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:14:01,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:01,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:14:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:14:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:14:01,757 INFO L87 Difference]: Start difference. First operand 493 states and 632 transitions. Second operand 6 states. [2018-11-18 12:14:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:01,816 INFO L93 Difference]: Finished difference Result 865 states and 1160 transitions. [2018-11-18 12:14:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:14:01,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2018-11-18 12:14:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:01,819 INFO L225 Difference]: With dead ends: 865 [2018-11-18 12:14:01,819 INFO L226 Difference]: Without dead ends: 509 [2018-11-18 12:14:01,820 INFO L604 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-11-18 12:14:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-18 12:14:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 498. [2018-11-18 12:14:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-11-18 12:14:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 636 transitions. [2018-11-18 12:14:01,860 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 636 transitions. Word has length 198 [2018-11-18 12:14:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 636 transitions. [2018-11-18 12:14:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:14:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 636 transitions. [2018-11-18 12:14:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 12:14:01,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:01,862 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:14:01,862 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:01,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash -381280600, now seen corresponding path program 1 times [2018-11-18 12:14:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:01,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:01,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 12:14:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:01,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:14:01,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:01,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:14:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:14:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:14:01,932 INFO L87 Difference]: Start difference. First operand 498 states and 636 transitions. Second operand 6 states. [2018-11-18 12:14:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:02,011 INFO L93 Difference]: Finished difference Result 885 states and 1183 transitions. [2018-11-18 12:14:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:14:02,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-11-18 12:14:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:02,013 INFO L225 Difference]: With dead ends: 885 [2018-11-18 12:14:02,013 INFO L226 Difference]: Without dead ends: 524 [2018-11-18 12:14:02,014 INFO L604 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-11-18 12:14:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-18 12:14:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2018-11-18 12:14:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-18 12:14:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 646 transitions. [2018-11-18 12:14:02,040 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 646 transitions. Word has length 175 [2018-11-18 12:14:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:02,041 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 646 transitions. [2018-11-18 12:14:02,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:14:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 646 transitions. [2018-11-18 12:14:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 12:14:02,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:02,042 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:14:02,042 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:02,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1557881446, now seen corresponding path program 1 times [2018-11-18 12:14:02,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:02,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:02,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 12:14:02,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:14:02,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:14:02,088 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-18 12:14:02,088 INFO L202 CegarAbsIntRunner]: [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [184], [186], [188], [189], [239], [241], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [504], [517], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:14:02,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:14:02,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:14:02,133 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:14:02,134 INFO L272 AbstractInterpreter]: Visited 120 different actions 161 times. Never merged. Never widened. Performed 1246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:14:02,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:02,142 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:14:02,232 INFO L227 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 78.33% of their original sizes. [2018-11-18 12:14:02,232 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:14:02,988 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-18 12:14:02,988 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:14:02,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:14:02,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [4] total 66 [2018-11-18 12:14:02,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:02,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-18 12:14:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-18 12:14:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3575, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 12:14:02,990 INFO L87 Difference]: Start difference. First operand 508 states and 646 transitions. Second operand 64 states. [2018-11-18 12:14:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:17,144 INFO L93 Difference]: Finished difference Result 2244 states and 3064 transitions. [2018-11-18 12:14:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-11-18 12:14:17,144 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 175 [2018-11-18 12:14:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:17,150 INFO L225 Difference]: With dead ends: 2244 [2018-11-18 12:14:17,150 INFO L226 Difference]: Without dead ends: 1759 [2018-11-18 12:14:17,157 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10906 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2706, Invalid=28094, Unknown=0, NotChecked=0, Total=30800 [2018-11-18 12:14:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-11-18 12:14:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1695. [2018-11-18 12:14:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2018-11-18 12:14:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2200 transitions. [2018-11-18 12:14:17,291 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2200 transitions. Word has length 175 [2018-11-18 12:14:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:17,292 INFO L480 AbstractCegarLoop]: Abstraction has 1695 states and 2200 transitions. [2018-11-18 12:14:17,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-18 12:14:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2200 transitions. [2018-11-18 12:14:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 12:14:17,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:17,294 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:14:17,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:17,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash -169946441, now seen corresponding path program 1 times [2018-11-18 12:14:17,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:17,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:17,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 12:14:17,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:14:17,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:14:17,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:17,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:14:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:14:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:14:17,368 INFO L87 Difference]: Start difference. First operand 1695 states and 2200 transitions. Second operand 5 states. [2018-11-18 12:14:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:17,895 INFO L93 Difference]: Finished difference Result 4075 states and 5536 transitions. [2018-11-18 12:14:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:14:17,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-11-18 12:14:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:17,901 INFO L225 Difference]: With dead ends: 4075 [2018-11-18 12:14:17,902 INFO L226 Difference]: Without dead ends: 2636 [2018-11-18 12:14:17,906 INFO L604 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-11-18 12:14:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2018-11-18 12:14:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2558. [2018-11-18 12:14:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-11-18 12:14:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3358 transitions. [2018-11-18 12:14:18,106 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3358 transitions. Word has length 183 [2018-11-18 12:14:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:18,106 INFO L480 AbstractCegarLoop]: Abstraction has 2558 states and 3358 transitions. [2018-11-18 12:14:18,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:14:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3358 transitions. [2018-11-18 12:14:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-18 12:14:18,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:18,110 INFO L375 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, 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-11-18 12:14:18,110 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:18,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1375120832, now seen corresponding path program 1 times [2018-11-18 12:14:18,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:18,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 12:14:18,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:14:18,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:14:18,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-11-18 12:14:18,179 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [495], [498], [517], [521], [524], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:14:18,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:14:18,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:14:18,238 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:14:18,239 INFO L272 AbstractInterpreter]: Visited 131 different actions 174 times. Never merged. Never widened. Performed 1312 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1312 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:14:18,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:18,242 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:14:18,384 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 74.33% of their original sizes. [2018-11-18 12:14:18,384 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:14:19,153 INFO L415 sIntCurrentIteration]: We unified 236 AI predicates to 236 [2018-11-18 12:14:19,153 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:14:19,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:14:19,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2018-11-18 12:14:19,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:19,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-18 12:14:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-18 12:14:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3499, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 12:14:19,155 INFO L87 Difference]: Start difference. First operand 2558 states and 3358 transitions. Second operand 63 states. [2018-11-18 12:14:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:31,828 INFO L93 Difference]: Finished difference Result 3377 states and 4504 transitions. [2018-11-18 12:14:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-18 12:14:31,828 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 237 [2018-11-18 12:14:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:31,835 INFO L225 Difference]: With dead ends: 3377 [2018-11-18 12:14:31,835 INFO L226 Difference]: Without dead ends: 2944 [2018-11-18 12:14:31,838 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5684 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1518, Invalid=16038, Unknown=0, NotChecked=0, Total=17556 [2018-11-18 12:14:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-11-18 12:14:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2894. [2018-11-18 12:14:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2018-11-18 12:14:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3796 transitions. [2018-11-18 12:14:31,967 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3796 transitions. Word has length 237 [2018-11-18 12:14:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:31,968 INFO L480 AbstractCegarLoop]: Abstraction has 2894 states and 3796 transitions. [2018-11-18 12:14:31,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-18 12:14:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3796 transitions. [2018-11-18 12:14:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-18 12:14:31,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:31,971 INFO L375 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, 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-11-18 12:14:31,971 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:31,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 112613571, now seen corresponding path program 1 times [2018-11-18 12:14:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:31,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:31,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:31,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 12:14:32,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:14:32,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:14:32,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-11-18 12:14:32,094 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [495], [498], [508], [514], [521], [524], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:14:32,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:14:32,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:14:32,156 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:14:32,157 INFO L272 AbstractInterpreter]: Visited 136 different actions 179 times. Never merged. Never widened. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 12:14:32,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:32,170 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:14:32,291 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 74.71% of their original sizes. [2018-11-18 12:14:32,291 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:14:33,104 INFO L415 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2018-11-18 12:14:33,104 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:14:33,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:14:33,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2018-11-18 12:14:33,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:33,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-18 12:14:33,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-18 12:14:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 12:14:33,106 INFO L87 Difference]: Start difference. First operand 2894 states and 3796 transitions. Second operand 65 states. [2018-11-18 12:14:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:42,451 INFO L93 Difference]: Finished difference Result 3397 states and 4484 transitions. [2018-11-18 12:14:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 12:14:42,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 238 [2018-11-18 12:14:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:42,460 INFO L225 Difference]: With dead ends: 3397 [2018-11-18 12:14:42,460 INFO L226 Difference]: Without dead ends: 2964 [2018-11-18 12:14:42,463 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1525, Invalid=16565, Unknown=0, NotChecked=0, Total=18090 [2018-11-18 12:14:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2018-11-18 12:14:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2899. [2018-11-18 12:14:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-11-18 12:14:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3804 transitions. [2018-11-18 12:14:42,685 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3804 transitions. Word has length 238 [2018-11-18 12:14:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:42,685 INFO L480 AbstractCegarLoop]: Abstraction has 2899 states and 3804 transitions. [2018-11-18 12:14:42,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-18 12:14:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3804 transitions. [2018-11-18 12:14:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-18 12:14:42,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:42,689 INFO L375 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, 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-11-18 12:14:42,690 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:42,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1504875583, now seen corresponding path program 1 times [2018-11-18 12:14:42,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:42,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:42,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:42,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 12:14:42,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:14:42,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:14:42,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-11-18 12:14:42,759 INFO L202 CegarAbsIntRunner]: [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [495], [501], [508], [511], [521], [524], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:14:42,761 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:14:42,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:14:42,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:14:42,798 INFO L272 AbstractInterpreter]: Visited 136 different actions 179 times. Never merged. Never widened. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 12:14:42,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:42,806 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:14:42,891 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 74.8% of their original sizes. [2018-11-18 12:14:42,891 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:14:43,763 INFO L415 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2018-11-18 12:14:43,763 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:14:43,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:14:43,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [5] total 68 [2018-11-18 12:14:43,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:43,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-18 12:14:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-18 12:14:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=3745, Unknown=0, NotChecked=0, Total=4160 [2018-11-18 12:14:43,764 INFO L87 Difference]: Start difference. First operand 2899 states and 3804 transitions. Second operand 65 states. [2018-11-18 12:14:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:14:51,478 INFO L93 Difference]: Finished difference Result 3766 states and 5040 transitions. [2018-11-18 12:14:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 12:14:51,479 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 238 [2018-11-18 12:14:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:14:51,493 INFO L225 Difference]: With dead ends: 3766 [2018-11-18 12:14:51,493 INFO L226 Difference]: Without dead ends: 3333 [2018-11-18 12:14:51,498 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5835 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1548, Invalid=16542, Unknown=0, NotChecked=0, Total=18090 [2018-11-18 12:14:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-11-18 12:14:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3264. [2018-11-18 12:14:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2018-11-18 12:14:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4291 transitions. [2018-11-18 12:14:51,775 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4291 transitions. Word has length 238 [2018-11-18 12:14:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:14:51,776 INFO L480 AbstractCegarLoop]: Abstraction has 3264 states and 4291 transitions. [2018-11-18 12:14:51,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-18 12:14:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4291 transitions. [2018-11-18 12:14:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-18 12:14:51,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:14:51,780 INFO L375 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, 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-11-18 12:14:51,780 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:14:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2093835979, now seen corresponding path program 1 times [2018-11-18 12:14:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:14:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:14:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:14:51,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:14:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 12:14:51,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:14:51,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:14:51,834 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-18 12:14:51,834 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [495], [498], [508], [511], [521], [524], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:14:51,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:14:51,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:14:51,874 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:14:51,874 INFO L272 AbstractInterpreter]: Visited 143 different actions 186 times. Never merged. Never widened. Performed 1430 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1430 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 12:14:51,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:14:51,882 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:14:51,970 INFO L227 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 75.14% of their original sizes. [2018-11-18 12:14:51,970 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:14:52,797 INFO L415 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2018-11-18 12:14:52,797 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:14:52,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:14:52,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [67] imperfect sequences [5] total 70 [2018-11-18 12:14:52,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:14:52,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-18 12:14:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-18 12:14:52,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4002, Unknown=0, NotChecked=0, Total=4422 [2018-11-18 12:14:52,799 INFO L87 Difference]: Start difference. First operand 3264 states and 4291 transitions. Second operand 67 states. [2018-11-18 12:15:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:08,708 INFO L93 Difference]: Finished difference Result 4144 states and 5553 transitions. [2018-11-18 12:15:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-18 12:15:08,708 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 245 [2018-11-18 12:15:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:08,715 INFO L225 Difference]: With dead ends: 4144 [2018-11-18 12:15:08,715 INFO L226 Difference]: Without dead ends: 3711 [2018-11-18 12:15:08,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 314 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1531, Invalid=17101, Unknown=0, NotChecked=0, Total=18632 [2018-11-18 12:15:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-11-18 12:15:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3632. [2018-11-18 12:15:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3632 states. [2018-11-18 12:15:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 4786 transitions. [2018-11-18 12:15:08,909 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 4786 transitions. Word has length 245 [2018-11-18 12:15:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:08,910 INFO L480 AbstractCegarLoop]: Abstraction has 3632 states and 4786 transitions. [2018-11-18 12:15:08,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-18 12:15:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 4786 transitions. [2018-11-18 12:15:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 12:15:08,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:08,915 INFO L375 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, 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] [2018-11-18 12:15:08,916 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:08,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash -73602170, now seen corresponding path program 1 times [2018-11-18 12:15:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:08,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:08,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 41 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 12:15:09,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:15:09,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:15:09,009 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-18 12:15:09,009 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [517], [521], [524], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:15:09,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:15:09,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:15:09,094 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:15:09,094 INFO L272 AbstractInterpreter]: Visited 133 different actions 187 times. Merged at 4 different actions 4 times. Never widened. Performed 1531 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1531 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 52 variables. [2018-11-18 12:15:09,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:09,097 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:15:09,277 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 75.83% of their original sizes. [2018-11-18 12:15:09,277 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:15:10,274 INFO L415 sIntCurrentIteration]: We unified 251 AI predicates to 251 [2018-11-18 12:15:10,274 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:15:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:15:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [4] total 75 [2018-11-18 12:15:10,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:10,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-18 12:15:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-18 12:15:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=4620, Unknown=0, NotChecked=0, Total=5256 [2018-11-18 12:15:10,275 INFO L87 Difference]: Start difference. First operand 3632 states and 4786 transitions. Second operand 73 states. [2018-11-18 12:15:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:28,441 INFO L93 Difference]: Finished difference Result 5579 states and 7370 transitions. [2018-11-18 12:15:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-11-18 12:15:28,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 252 [2018-11-18 12:15:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:28,452 INFO L225 Difference]: With dead ends: 5579 [2018-11-18 12:15:28,452 INFO L226 Difference]: Without dead ends: 4178 [2018-11-18 12:15:28,457 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 347 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9726 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2416, Invalid=25976, Unknown=0, NotChecked=0, Total=28392 [2018-11-18 12:15:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2018-11-18 12:15:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4080. [2018-11-18 12:15:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2018-11-18 12:15:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 5364 transitions. [2018-11-18 12:15:28,677 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 5364 transitions. Word has length 252 [2018-11-18 12:15:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 4080 states and 5364 transitions. [2018-11-18 12:15:28,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-18 12:15:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5364 transitions. [2018-11-18 12:15:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-18 12:15:28,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:28,682 INFO L375 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, 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-11-18 12:15:28,682 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:28,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -220806941, now seen corresponding path program 1 times [2018-11-18 12:15:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:28,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:28,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:28,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:28,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 12:15:28,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:15:28,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:15:28,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-18 12:15:28,755 INFO L202 CegarAbsIntRunner]: [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [504], [508], [511], [517], [521], [524], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:15:28,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:15:28,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:15:28,803 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:15:28,803 INFO L272 AbstractInterpreter]: Visited 140 different actions 201 times. Merged at 8 different actions 8 times. Never widened. Performed 1823 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1823 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 12:15:28,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:28,806 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:15:28,905 INFO L227 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 76.1% of their original sizes. [2018-11-18 12:15:28,905 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:15:29,957 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-18 12:15:29,957 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:15:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:15:29,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [4] total 77 [2018-11-18 12:15:29,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:15:29,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-18 12:15:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-18 12:15:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4906, Unknown=0, NotChecked=0, Total=5550 [2018-11-18 12:15:29,959 INFO L87 Difference]: Start difference. First operand 4080 states and 5364 transitions. Second operand 75 states. [2018-11-18 12:15:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:15:59,463 INFO L93 Difference]: Finished difference Result 5756 states and 7612 transitions. [2018-11-18 12:15:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-11-18 12:15:59,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 253 [2018-11-18 12:15:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:15:59,476 INFO L225 Difference]: With dead ends: 5756 [2018-11-18 12:15:59,476 INFO L226 Difference]: Without dead ends: 4690 [2018-11-18 12:15:59,482 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10348 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2528, Invalid=27574, Unknown=0, NotChecked=0, Total=30102 [2018-11-18 12:15:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2018-11-18 12:15:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4567. [2018-11-18 12:15:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2018-11-18 12:15:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 5988 transitions. [2018-11-18 12:15:59,876 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 5988 transitions. Word has length 253 [2018-11-18 12:15:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:15:59,876 INFO L480 AbstractCegarLoop]: Abstraction has 4567 states and 5988 transitions. [2018-11-18 12:15:59,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-18 12:15:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 5988 transitions. [2018-11-18 12:15:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-18 12:15:59,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:15:59,882 INFO L375 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, 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] [2018-11-18 12:15:59,882 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:15:59,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:15:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1276087611, now seen corresponding path program 1 times [2018-11-18 12:15:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:15:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:15:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:15:59,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:15:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 12:15:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:15:59,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:15:59,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-18 12:15:59,955 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [517], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:15:59,956 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:15:59,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:00,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:00,105 INFO L272 AbstractInterpreter]: Visited 144 different actions 365 times. Merged at 17 different actions 33 times. Never widened. Performed 4935 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4935 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 54 variables. [2018-11-18 12:16:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:00,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:00,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:00,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:00,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:00,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:00,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 12:16:00,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 12:16:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 12:16:00,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:00,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:16:00,514 INFO L87 Difference]: Start difference. First operand 4567 states and 5988 transitions. Second operand 3 states. [2018-11-18 12:16:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:00,967 INFO L93 Difference]: Finished difference Result 8449 states and 11859 transitions. [2018-11-18 12:16:00,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:00,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2018-11-18 12:16:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:00,981 INFO L225 Difference]: With dead ends: 8449 [2018-11-18 12:16:00,981 INFO L226 Difference]: Without dead ends: 6456 [2018-11-18 12:16:00,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 502 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:16:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2018-11-18 12:16:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 6432. [2018-11-18 12:16:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2018-11-18 12:16:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 8753 transitions. [2018-11-18 12:16:01,305 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 8753 transitions. Word has length 254 [2018-11-18 12:16:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:01,305 INFO L480 AbstractCegarLoop]: Abstraction has 6432 states and 8753 transitions. [2018-11-18 12:16:01,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 8753 transitions. [2018-11-18 12:16:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-18 12:16:01,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:01,311 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:01,312 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:01,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220004, now seen corresponding path program 1 times [2018-11-18 12:16:01,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:01,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 12:16:01,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:01,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:01,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-18 12:16:01,380 INFO L202 CegarAbsIntRunner]: [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [504], [508], [511], [517], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:01,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:01,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:01,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:01,500 INFO L272 AbstractInterpreter]: Visited 147 different actions 375 times. Merged at 17 different actions 33 times. Never widened. Performed 5100 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5100 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 54 variables. [2018-11-18 12:16:01,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:01,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:01,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:01,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:01,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:01,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:01,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 12:16:01,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-18 12:16:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-11-18 12:16:01,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:01,821 INFO L87 Difference]: Start difference. First operand 6432 states and 8753 transitions. Second operand 3 states. [2018-11-18 12:16:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:02,056 INFO L93 Difference]: Finished difference Result 7101 states and 9679 transitions. [2018-11-18 12:16:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:02,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2018-11-18 12:16:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:02,066 INFO L225 Difference]: With dead ends: 7101 [2018-11-18 12:16:02,066 INFO L226 Difference]: Without dead ends: 5153 [2018-11-18 12:16:02,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2018-11-18 12:16:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5140. [2018-11-18 12:16:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-11-18 12:16:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 6775 transitions. [2018-11-18 12:16:02,397 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 6775 transitions. Word has length 254 [2018-11-18 12:16:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 6775 transitions. [2018-11-18 12:16:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 6775 transitions. [2018-11-18 12:16:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-18 12:16:02,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:02,403 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:02,403 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:02,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1004583861, now seen corresponding path program 1 times [2018-11-18 12:16:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:02,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 12:16:02,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:02,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:02,484 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-18 12:16:02,484 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [517], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:02,486 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:02,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:02,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:02,699 INFO L272 AbstractInterpreter]: Visited 147 different actions 471 times. Merged at 36 different actions 82 times. Never widened. Performed 5595 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5595 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:16:02,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:02,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:02,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:02,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:02,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:02,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:02,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 12:16:02,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 12:16:02,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-11-18 12:16:02,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:02,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:02,963 INFO L87 Difference]: Start difference. First operand 5140 states and 6775 transitions. Second operand 3 states. [2018-11-18 12:16:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:03,286 INFO L93 Difference]: Finished difference Result 9436 states and 12925 transitions. [2018-11-18 12:16:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:03,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2018-11-18 12:16:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:03,306 INFO L225 Difference]: With dead ends: 9436 [2018-11-18 12:16:03,306 INFO L226 Difference]: Without dead ends: 6622 [2018-11-18 12:16:03,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 509 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-11-18 12:16:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-11-18 12:16:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 6602. [2018-11-18 12:16:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2018-11-18 12:16:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 8891 transitions. [2018-11-18 12:16:03,785 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 8891 transitions. Word has length 254 [2018-11-18 12:16:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 6602 states and 8891 transitions. [2018-11-18 12:16:03,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 8891 transitions. [2018-11-18 12:16:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-18 12:16:03,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:03,792 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:03,793 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:03,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1143663201, now seen corresponding path program 1 times [2018-11-18 12:16:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:03,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 12:16:03,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:03,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:03,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-18 12:16:03,881 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [501], [508], [514], [517], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:03,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:03,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:04,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:04,059 INFO L272 AbstractInterpreter]: Visited 147 different actions 465 times. Merged at 37 different actions 79 times. Never widened. Performed 4811 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4811 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:16:04,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:04,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:04,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:04,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:04,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:04,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 12:16:04,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 12:16:04,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:04,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-11-18 12:16:04,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:04,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:16:04,359 INFO L87 Difference]: Start difference. First operand 6602 states and 8891 transitions. Second operand 3 states. [2018-11-18 12:16:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:04,829 INFO L93 Difference]: Finished difference Result 13493 states and 19412 transitions. [2018-11-18 12:16:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:04,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-11-18 12:16:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:04,852 INFO L225 Difference]: With dead ends: 13493 [2018-11-18 12:16:04,852 INFO L226 Difference]: Without dead ends: 9941 [2018-11-18 12:16:04,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 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-11-18 12:16:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2018-11-18 12:16:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 9829. [2018-11-18 12:16:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9829 states. [2018-11-18 12:16:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9829 states to 9829 states and 13941 transitions. [2018-11-18 12:16:05,480 INFO L78 Accepts]: Start accepts. Automaton has 9829 states and 13941 transitions. Word has length 255 [2018-11-18 12:16:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:05,480 INFO L480 AbstractCegarLoop]: Abstraction has 9829 states and 13941 transitions. [2018-11-18 12:16:05,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9829 states and 13941 transitions. [2018-11-18 12:16:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-18 12:16:05,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:05,488 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:05,488 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:05,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 776224071, now seen corresponding path program 1 times [2018-11-18 12:16:05,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:05,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 12:16:05,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:05,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:05,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-11-18 12:16:05,571 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [501], [508], [511], [517], [521], [524], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:05,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:05,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:05,675 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:16:05,676 INFO L272 AbstractInterpreter]: Visited 149 different actions 249 times. Merged at 10 different actions 21 times. Never widened. Performed 2622 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 54 variables. [2018-11-18 12:16:05,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:05,686 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:16:05,784 INFO L227 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 76.3% of their original sizes. [2018-11-18 12:16:05,784 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:16:07,018 INFO L415 sIntCurrentIteration]: We unified 260 AI predicates to 260 [2018-11-18 12:16:07,018 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:16:07,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [5] total 84 [2018-11-18 12:16:07,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:07,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-18 12:16:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-18 12:16:07,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=5753, Unknown=0, NotChecked=0, Total=6480 [2018-11-18 12:16:07,019 INFO L87 Difference]: Start difference. First operand 9829 states and 13941 transitions. Second operand 81 states. [2018-11-18 12:16:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:29,862 INFO L93 Difference]: Finished difference Result 26488 states and 38807 transitions. [2018-11-18 12:16:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-11-18 12:16:29,862 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 261 [2018-11-18 12:16:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:29,899 INFO L225 Difference]: With dead ends: 26488 [2018-11-18 12:16:29,899 INFO L226 Difference]: Without dead ends: 17305 [2018-11-18 12:16:29,938 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 392 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16223 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3261, Invalid=41895, Unknown=0, NotChecked=0, Total=45156 [2018-11-18 12:16:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2018-11-18 12:16:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16824. [2018-11-18 12:16:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16824 states. [2018-11-18 12:16:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 23180 transitions. [2018-11-18 12:16:30,845 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 23180 transitions. Word has length 261 [2018-11-18 12:16:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:30,845 INFO L480 AbstractCegarLoop]: Abstraction has 16824 states and 23180 transitions. [2018-11-18 12:16:30,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-18 12:16:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 23180 transitions. [2018-11-18 12:16:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-18 12:16:30,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:30,851 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:30,851 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:30,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:30,851 INFO L82 PathProgramCache]: Analyzing trace with hash -172777814, now seen corresponding path program 1 times [2018-11-18 12:16:30,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:30,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:30,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:30,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-18 12:16:30,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:30,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:30,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-18 12:16:30,935 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [501], [508], [514], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:30,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:30,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:31,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:31,153 INFO L272 AbstractInterpreter]: Visited 146 different actions 461 times. Merged at 37 different actions 79 times. Never widened. Performed 5057 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5057 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:16:31,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:31,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:31,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:31,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:31,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:31,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:31,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 12:16:31,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-18 12:16:31,566 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:31,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [4] total 6 [2018-11-18 12:16:31,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:31,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:31,566 INFO L87 Difference]: Start difference. First operand 16824 states and 23180 transitions. Second operand 3 states. [2018-11-18 12:16:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:32,300 INFO L93 Difference]: Finished difference Result 29397 states and 42079 transitions. [2018-11-18 12:16:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:32,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-11-18 12:16:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:32,331 INFO L225 Difference]: With dead ends: 29397 [2018-11-18 12:16:32,331 INFO L226 Difference]: Without dead ends: 14230 [2018-11-18 12:16:32,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 506 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:16:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14230 states. [2018-11-18 12:16:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14230 to 13628. [2018-11-18 12:16:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13628 states. [2018-11-18 12:16:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13628 states to 13628 states and 18377 transitions. [2018-11-18 12:16:33,046 INFO L78 Accepts]: Start accepts. Automaton has 13628 states and 18377 transitions. Word has length 256 [2018-11-18 12:16:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:33,047 INFO L480 AbstractCegarLoop]: Abstraction has 13628 states and 18377 transitions. [2018-11-18 12:16:33,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13628 states and 18377 transitions. [2018-11-18 12:16:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-18 12:16:33,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:33,053 INFO L375 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, 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-11-18 12:16:33,053 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:33,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969995, now seen corresponding path program 1 times [2018-11-18 12:16:33,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:33,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:33,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:33,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:33,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 12:16:33,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:33,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:33,151 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-18 12:16:33,151 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [511], [517], [521], [524], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:33,152 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:33,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:33,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:33,289 INFO L272 AbstractInterpreter]: Visited 155 different actions 423 times. Merged at 26 different actions 50 times. Never widened. Performed 5402 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5402 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 8 different actions. Largest state had 54 variables. [2018-11-18 12:16:33,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:33,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:33,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:33,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:33,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:33,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:33,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 12:16:33,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 12:16:33,507 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:33,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-11-18 12:16:33,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:33,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:16:33,508 INFO L87 Difference]: Start difference. First operand 13628 states and 18377 transitions. Second operand 3 states. [2018-11-18 12:16:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:34,409 INFO L93 Difference]: Finished difference Result 22405 states and 33238 transitions. [2018-11-18 12:16:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:34,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2018-11-18 12:16:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:34,440 INFO L225 Difference]: With dead ends: 22405 [2018-11-18 12:16:34,440 INFO L226 Difference]: Without dead ends: 16985 [2018-11-18 12:16:34,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 525 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-11-18 12:16:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16985 states. [2018-11-18 12:16:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16985 to 16892. [2018-11-18 12:16:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16892 states. [2018-11-18 12:16:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16892 states to 16892 states and 23802 transitions. [2018-11-18 12:16:35,325 INFO L78 Accepts]: Start accepts. Automaton has 16892 states and 23802 transitions. Word has length 262 [2018-11-18 12:16:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:35,325 INFO L480 AbstractCegarLoop]: Abstraction has 16892 states and 23802 transitions. [2018-11-18 12:16:35,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 16892 states and 23802 transitions. [2018-11-18 12:16:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-18 12:16:35,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:35,335 INFO L375 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, 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] [2018-11-18 12:16:35,335 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:35,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash -157261658, now seen corresponding path program 1 times [2018-11-18 12:16:35,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:35,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:35,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:35,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:35,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-18 12:16:35,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:35,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:35,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-18 12:16:35,429 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [521], [524], [527], [536], [539], [542], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:35,430 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:35,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:35,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:35,575 INFO L272 AbstractInterpreter]: Visited 147 different actions 447 times. Merged at 36 different actions 72 times. Never widened. Performed 4893 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4893 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 7 different actions. Largest state had 54 variables. [2018-11-18 12:16:35,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:35,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:35,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:35,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:35,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:35,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 12:16:35,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-18 12:16:36,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-11-18 12:16:36,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:36,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:16:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:16:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:16:36,019 INFO L87 Difference]: Start difference. First operand 16892 states and 23802 transitions. Second operand 4 states. [2018-11-18 12:16:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:37,473 INFO L93 Difference]: Finished difference Result 37551 states and 62233 transitions. [2018-11-18 12:16:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:16:37,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-11-18 12:16:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:37,529 INFO L225 Difference]: With dead ends: 37551 [2018-11-18 12:16:37,529 INFO L226 Difference]: Without dead ends: 21259 [2018-11-18 12:16:37,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 500 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-11-18 12:16:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-11-18 12:16:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 18523. [2018-11-18 12:16:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18523 states. [2018-11-18 12:16:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 25522 transitions. [2018-11-18 12:16:38,795 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 25522 transitions. Word has length 256 [2018-11-18 12:16:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:38,795 INFO L480 AbstractCegarLoop]: Abstraction has 18523 states and 25522 transitions. [2018-11-18 12:16:38,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:16:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 25522 transitions. [2018-11-18 12:16:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-18 12:16:38,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:38,804 INFO L375 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, 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-11-18 12:16:38,804 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:38,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1119978888, now seen corresponding path program 1 times [2018-11-18 12:16:38,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:38,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 12:16:38,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:38,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:38,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-18 12:16:38,871 INFO L202 CegarAbsIntRunner]: [32], [43], [49], [51], [59], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [280], [283], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [491], [495], [501], [508], [511], [514], [521], [524], [530], [536], [539], [542], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [609], [610], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:38,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:38,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:38,924 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:16:38,924 INFO L272 AbstractInterpreter]: Visited 142 different actions 224 times. Merged at 16 different actions 21 times. Never widened. Performed 2047 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2047 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 54 variables. [2018-11-18 12:16:38,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:38,934 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:16:39,049 INFO L227 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.72% of their original sizes. [2018-11-18 12:16:39,049 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:16:40,207 INFO L415 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2018-11-18 12:16:40,207 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:16:40,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:40,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [5] total 76 [2018-11-18 12:16:40,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:40,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-18 12:16:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-18 12:16:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=4805, Unknown=0, NotChecked=0, Total=5256 [2018-11-18 12:16:40,209 INFO L87 Difference]: Start difference. First operand 18523 states and 25522 transitions. Second operand 73 states. [2018-11-18 12:16:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:52,932 INFO L93 Difference]: Finished difference Result 28504 states and 40446 transitions. [2018-11-18 12:16:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-18 12:16:52,932 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 255 [2018-11-18 12:16:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:52,964 INFO L225 Difference]: With dead ends: 28504 [2018-11-18 12:16:52,964 INFO L226 Difference]: Without dead ends: 13177 [2018-11-18 12:16:52,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 328 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7301 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1754, Invalid=19708, Unknown=0, NotChecked=0, Total=21462 [2018-11-18 12:16:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13177 states. [2018-11-18 12:16:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13177 to 12509. [2018-11-18 12:16:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12509 states. [2018-11-18 12:16:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12509 states to 12509 states and 17336 transitions. [2018-11-18 12:16:53,701 INFO L78 Accepts]: Start accepts. Automaton has 12509 states and 17336 transitions. Word has length 255 [2018-11-18 12:16:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:53,701 INFO L480 AbstractCegarLoop]: Abstraction has 12509 states and 17336 transitions. [2018-11-18 12:16:53,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-18 12:16:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12509 states and 17336 transitions. [2018-11-18 12:16:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-18 12:16:53,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:53,707 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:16:53,708 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:53,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 264980137, now seen corresponding path program 1 times [2018-11-18 12:16:53,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:53,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 12:16:53,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:53,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:53,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-11-18 12:16:53,819 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [521], [524], [527], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:53,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:53,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:53,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:53,978 INFO L272 AbstractInterpreter]: Visited 147 different actions 442 times. Merged at 35 different actions 69 times. Never widened. Performed 5552 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5552 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 5 different actions. Largest state had 54 variables. [2018-11-18 12:16:53,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:53,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:53,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:53,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:53,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:53,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:54,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 12:16:54,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 12:16:54,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 4] total 12 [2018-11-18 12:16:54,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:54,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:16:54,303 INFO L87 Difference]: Start difference. First operand 12509 states and 17336 transitions. Second operand 3 states. [2018-11-18 12:16:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:55,062 INFO L93 Difference]: Finished difference Result 24200 states and 34103 transitions. [2018-11-18 12:16:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:55,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2018-11-18 12:16:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:55,089 INFO L225 Difference]: With dead ends: 24200 [2018-11-18 12:16:55,090 INFO L226 Difference]: Without dead ends: 15028 [2018-11-18 12:16:55,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 506 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:16:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15028 states. [2018-11-18 12:16:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15028 to 14931. [2018-11-18 12:16:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2018-11-18 12:16:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 20693 transitions. [2018-11-18 12:16:56,007 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 20693 transitions. Word has length 257 [2018-11-18 12:16:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:56,007 INFO L480 AbstractCegarLoop]: Abstraction has 14931 states and 20693 transitions. [2018-11-18 12:16:56,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 20693 transitions. [2018-11-18 12:16:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-18 12:16:56,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:56,016 INFO L375 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, 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-11-18 12:16:56,016 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:56,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 104245258, now seen corresponding path program 1 times [2018-11-18 12:16:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:56,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-18 12:16:56,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:56,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:56,120 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-11-18 12:16:56,120 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [521], [524], [527], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:56,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:56,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:56,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:16:56,255 INFO L272 AbstractInterpreter]: Visited 146 different actions 436 times. Merged at 35 different actions 69 times. Never widened. Performed 5551 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5551 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 5 different actions. Largest state had 54 variables. [2018-11-18 12:16:56,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:56,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:16:56,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:56,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:16:56,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:56,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:16:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:56,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:16:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 12:16:56,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:16:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-18 12:16:56,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:16:56,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 4] total 12 [2018-11-18 12:16:56,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:56,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:16:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:16:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:16:56,517 INFO L87 Difference]: Start difference. First operand 14931 states and 20693 transitions. Second operand 3 states. [2018-11-18 12:16:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:16:57,240 INFO L93 Difference]: Finished difference Result 21447 states and 29743 transitions. [2018-11-18 12:16:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:16:57,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2018-11-18 12:16:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:16:57,266 INFO L225 Difference]: With dead ends: 21447 [2018-11-18 12:16:57,266 INFO L226 Difference]: Without dead ends: 14995 [2018-11-18 12:16:57,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 508 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:16:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14995 states. [2018-11-18 12:16:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14995 to 14931. [2018-11-18 12:16:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2018-11-18 12:16:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 20115 transitions. [2018-11-18 12:16:58,054 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 20115 transitions. Word has length 258 [2018-11-18 12:16:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:16:58,055 INFO L480 AbstractCegarLoop]: Abstraction has 14931 states and 20115 transitions. [2018-11-18 12:16:58,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:16:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 20115 transitions. [2018-11-18 12:16:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-18 12:16:58,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:16:58,061 INFO L375 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, 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] [2018-11-18 12:16:58,061 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:16:58,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1025479166, now seen corresponding path program 1 times [2018-11-18 12:16:58,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:16:58,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:58,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:16:58,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:16:58,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:16:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:16:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-18 12:16:58,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:16:58,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:16:58,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-18 12:16:58,132 INFO L202 CegarAbsIntRunner]: [62], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [508], [511], [521], [527], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [609], [610], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:16:58,133 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:16:58,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:16:58,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:16:58,265 INFO L272 AbstractInterpreter]: Visited 142 different actions 415 times. Merged at 16 different actions 31 times. Never widened. Performed 5154 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 12:16:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:16:58,274 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:16:58,409 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 76.9% of their original sizes. [2018-11-18 12:16:58,410 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:16:59,845 INFO L415 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2018-11-18 12:16:59,846 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:16:59,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:16:59,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [93] imperfect sequences [4] total 95 [2018-11-18 12:16:59,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:16:59,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-18 12:16:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-18 12:16:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=7836, Unknown=0, NotChecked=0, Total=8556 [2018-11-18 12:16:59,847 INFO L87 Difference]: Start difference. First operand 14931 states and 20115 transitions. Second operand 93 states. [2018-11-18 12:17:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:31,703 INFO L93 Difference]: Finished difference Result 32755 states and 46992 transitions. [2018-11-18 12:17:31,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-11-18 12:17:31,703 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 255 [2018-11-18 12:17:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:31,740 INFO L225 Difference]: With dead ends: 32755 [2018-11-18 12:17:31,740 INFO L226 Difference]: Without dead ends: 21198 [2018-11-18 12:17:31,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 423 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23767 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5337, Invalid=63045, Unknown=0, NotChecked=0, Total=68382 [2018-11-18 12:17:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21198 states. [2018-11-18 12:17:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21198 to 20867. [2018-11-18 12:17:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20867 states. [2018-11-18 12:17:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20867 states to 20867 states and 28713 transitions. [2018-11-18 12:17:33,027 INFO L78 Accepts]: Start accepts. Automaton has 20867 states and 28713 transitions. Word has length 255 [2018-11-18 12:17:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:33,027 INFO L480 AbstractCegarLoop]: Abstraction has 20867 states and 28713 transitions. [2018-11-18 12:17:33,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-18 12:17:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20867 states and 28713 transitions. [2018-11-18 12:17:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-18 12:17:33,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:33,040 INFO L375 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, 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-11-18 12:17:33,040 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:33,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:33,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1155410184, now seen corresponding path program 1 times [2018-11-18 12:17:33,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:33,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:33,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 12:17:33,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:33,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:33,126 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-18 12:17:33,126 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [508], [514], [521], [527], [530], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [605], [606], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:33,127 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:33,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:33,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:33,280 INFO L272 AbstractInterpreter]: Visited 150 different actions 528 times. Merged at 38 different actions 89 times. Never widened. Performed 5724 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 12:17:33,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:33,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:33,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:33,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:33,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:33,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-18 12:17:33,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-18 12:17:33,509 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:17:33,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-18 12:17:33,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:33,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:17:33,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:17:33,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:17:33,510 INFO L87 Difference]: Start difference. First operand 20867 states and 28713 transitions. Second operand 3 states. [2018-11-18 12:17:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:34,976 INFO L93 Difference]: Finished difference Result 42931 states and 62908 transitions. [2018-11-18 12:17:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:17:34,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-11-18 12:17:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:35,032 INFO L225 Difference]: With dead ends: 42931 [2018-11-18 12:17:35,033 INFO L226 Difference]: Without dead ends: 25539 [2018-11-18 12:17:35,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 512 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-11-18 12:17:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25539 states. [2018-11-18 12:17:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25539 to 25286. [2018-11-18 12:17:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25286 states. [2018-11-18 12:17:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25286 states to 25286 states and 36126 transitions. [2018-11-18 12:17:36,617 INFO L78 Accepts]: Start accepts. Automaton has 25286 states and 36126 transitions. Word has length 256 [2018-11-18 12:17:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:36,617 INFO L480 AbstractCegarLoop]: Abstraction has 25286 states and 36126 transitions. [2018-11-18 12:17:36,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:17:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25286 states and 36126 transitions. [2018-11-18 12:17:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-18 12:17:36,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:36,633 INFO L375 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, 2, 2, 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-11-18 12:17:36,633 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:36,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1567993946, now seen corresponding path program 1 times [2018-11-18 12:17:36,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:36,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:36,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 12:17:36,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:36,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:36,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-11-18 12:17:36,713 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [508], [514], [521], [527], [536], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [605], [606], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:36,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:36,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:36,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:36,864 INFO L272 AbstractInterpreter]: Visited 149 different actions 537 times. Merged at 38 different actions 93 times. Never widened. Performed 6050 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6050 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 54 variables. [2018-11-18 12:17:36,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:36,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:36,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:36,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:36,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:36,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 12:17:37,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-18 12:17:37,185 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:17:37,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [6] total 10 [2018-11-18 12:17:37,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:37,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:17:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:17:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:17:37,186 INFO L87 Difference]: Start difference. First operand 25286 states and 36126 transitions. Second operand 4 states. [2018-11-18 12:17:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:39,104 INFO L93 Difference]: Finished difference Result 49253 states and 79351 transitions. [2018-11-18 12:17:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:17:39,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-11-18 12:17:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:39,164 INFO L225 Difference]: With dead ends: 49253 [2018-11-18 12:17:39,164 INFO L226 Difference]: Without dead ends: 26218 [2018-11-18 12:17:39,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 500 SyntacticMatches, 11 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:17:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26218 states. [2018-11-18 12:17:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26218 to 25333. [2018-11-18 12:17:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25333 states. [2018-11-18 12:17:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25333 states to 25333 states and 36055 transitions. [2018-11-18 12:17:40,860 INFO L78 Accepts]: Start accepts. Automaton has 25333 states and 36055 transitions. Word has length 257 [2018-11-18 12:17:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:40,860 INFO L480 AbstractCegarLoop]: Abstraction has 25333 states and 36055 transitions. [2018-11-18 12:17:40,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:17:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25333 states and 36055 transitions. [2018-11-18 12:17:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-18 12:17:40,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:40,871 INFO L375 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, 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] [2018-11-18 12:17:40,871 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:40,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash -81073606, now seen corresponding path program 1 times [2018-11-18 12:17:40,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:40,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:40,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-18 12:17:40,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:40,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:40,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-11-18 12:17:40,940 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [508], [514], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:40,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:40,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:41,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:41,137 INFO L272 AbstractInterpreter]: Visited 146 different actions 711 times. Merged at 48 different actions 142 times. Never widened. Performed 6650 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:17:41,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:41,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:41,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:41,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:41,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:41,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 12:17:41,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-18 12:17:41,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:17:41,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2018-11-18 12:17:41,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:17:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:17:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:17:41,446 INFO L87 Difference]: Start difference. First operand 25333 states and 36055 transitions. Second operand 4 states. [2018-11-18 12:17:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:43,394 INFO L93 Difference]: Finished difference Result 43506 states and 65854 transitions. [2018-11-18 12:17:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:17:43,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-11-18 12:17:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:43,449 INFO L225 Difference]: With dead ends: 43506 [2018-11-18 12:17:43,449 INFO L226 Difference]: Without dead ends: 25976 [2018-11-18 12:17:43,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:17:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25976 states. [2018-11-18 12:17:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25976 to 25055. [2018-11-18 12:17:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25055 states. [2018-11-18 12:17:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25055 states to 25055 states and 35814 transitions. [2018-11-18 12:17:45,145 INFO L78 Accepts]: Start accepts. Automaton has 25055 states and 35814 transitions. Word has length 258 [2018-11-18 12:17:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:45,145 INFO L480 AbstractCegarLoop]: Abstraction has 25055 states and 35814 transitions. [2018-11-18 12:17:45,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:17:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 25055 states and 35814 transitions. [2018-11-18 12:17:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-18 12:17:45,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:45,154 INFO L375 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, 2, 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-11-18 12:17:45,154 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:45,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1681884751, now seen corresponding path program 1 times [2018-11-18 12:17:45,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:45,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:45,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:45,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:45,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 12:17:45,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:45,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:45,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-18 12:17:45,200 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [112], [115], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [508], [511], [517], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:45,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:45,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:45,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:45,361 INFO L272 AbstractInterpreter]: Visited 157 different actions 527 times. Merged at 47 different actions 83 times. Never widened. Performed 5975 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5975 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:17:45,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:45,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:45,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:45,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:45,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:45,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 12:17:45,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-18 12:17:45,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:17:45,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2018-11-18 12:17:45,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:45,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:17:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:17:45,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:17:45,636 INFO L87 Difference]: Start difference. First operand 25055 states and 35814 transitions. Second operand 4 states. [2018-11-18 12:17:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:47,917 INFO L93 Difference]: Finished difference Result 52686 states and 90581 transitions. [2018-11-18 12:17:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:17:47,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-11-18 12:17:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:47,994 INFO L225 Difference]: With dead ends: 52686 [2018-11-18 12:17:47,995 INFO L226 Difference]: Without dead ends: 29978 [2018-11-18 12:17:48,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 515 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-11-18 12:17:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29978 states. [2018-11-18 12:17:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29978 to 27812. [2018-11-18 12:17:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27812 states. [2018-11-18 12:17:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27812 states to 27812 states and 40389 transitions. [2018-11-18 12:17:50,032 INFO L78 Accepts]: Start accepts. Automaton has 27812 states and 40389 transitions. Word has length 264 [2018-11-18 12:17:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:50,032 INFO L480 AbstractCegarLoop]: Abstraction has 27812 states and 40389 transitions. [2018-11-18 12:17:50,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:17:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27812 states and 40389 transitions. [2018-11-18 12:17:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-18 12:17:50,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:50,041 INFO L375 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, 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-11-18 12:17:50,042 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:50,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1491092979, now seen corresponding path program 1 times [2018-11-18 12:17:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:50,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 12:17:50,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:50,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:50,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-18 12:17:50,103 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [73], [79], [81], [89], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [508], [511], [517], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:50,104 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:50,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:50,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:50,248 INFO L272 AbstractInterpreter]: Visited 155 different actions 515 times. Merged at 47 different actions 83 times. Never widened. Performed 5946 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5946 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 6 different actions. Largest state had 54 variables. [2018-11-18 12:17:50,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:50,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:50,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:50,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:50,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:50,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 12:17:50,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 12:17:50,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:17:50,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 12:17:50,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:17:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:17:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:17:50,708 INFO L87 Difference]: Start difference. First operand 27812 states and 40389 transitions. Second operand 3 states. [2018-11-18 12:17:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:52,470 INFO L93 Difference]: Finished difference Result 49385 states and 79542 transitions. [2018-11-18 12:17:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:17:52,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-11-18 12:17:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:52,536 INFO L225 Difference]: With dead ends: 49385 [2018-11-18 12:17:52,536 INFO L226 Difference]: Without dead ends: 27727 [2018-11-18 12:17:52,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 522 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:17:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27727 states. [2018-11-18 12:17:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27727 to 27435. [2018-11-18 12:17:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27435 states. [2018-11-18 12:17:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27435 states to 27435 states and 39294 transitions. [2018-11-18 12:17:54,470 INFO L78 Accepts]: Start accepts. Automaton has 27435 states and 39294 transitions. Word has length 264 [2018-11-18 12:17:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:54,470 INFO L480 AbstractCegarLoop]: Abstraction has 27435 states and 39294 transitions. [2018-11-18 12:17:54,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:17:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27435 states and 39294 transitions. [2018-11-18 12:17:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-18 12:17:54,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:54,479 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:17:54,479 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:54,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1037822895, now seen corresponding path program 1 times [2018-11-18 12:17:54,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:54,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:54,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:54,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 12:17:54,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:54,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:54,555 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-18 12:17:54,555 INFO L202 CegarAbsIntRunner]: [2], [4], [7], [13], [19], [21], [23], [25], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [521], [524], [530], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [605], [606], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:54,556 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:54,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:54,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:54,939 INFO L272 AbstractInterpreter]: Visited 165 different actions 886 times. Merged at 59 different actions 147 times. Never widened. Performed 9599 root evaluator evaluations with a maximum evaluation depth of 3. Performed 9599 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 30 fixpoints after 14 different actions. Largest state had 54 variables. [2018-11-18 12:17:54,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:54,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:54,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:54,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:54,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:54,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:55,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-18 12:17:55,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 12:17:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:17:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-18 12:17:55,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:55,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:17:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:17:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:17:55,212 INFO L87 Difference]: Start difference. First operand 27435 states and 39294 transitions. Second operand 4 states. [2018-11-18 12:17:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:17:56,803 INFO L93 Difference]: Finished difference Result 40931 states and 60472 transitions. [2018-11-18 12:17:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:17:56,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2018-11-18 12:17:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:17:56,849 INFO L225 Difference]: With dead ends: 40931 [2018-11-18 12:17:56,849 INFO L226 Difference]: Without dead ends: 20839 [2018-11-18 12:17:56,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 673 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-11-18 12:17:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20839 states. [2018-11-18 12:17:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20839 to 20695. [2018-11-18 12:17:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20695 states. [2018-11-18 12:17:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20695 states to 20695 states and 28507 transitions. [2018-11-18 12:17:58,254 INFO L78 Accepts]: Start accepts. Automaton has 20695 states and 28507 transitions. Word has length 337 [2018-11-18 12:17:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:17:58,254 INFO L480 AbstractCegarLoop]: Abstraction has 20695 states and 28507 transitions. [2018-11-18 12:17:58,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:17:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20695 states and 28507 transitions. [2018-11-18 12:17:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-18 12:17:58,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:17:58,260 INFO L375 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, 2, 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] [2018-11-18 12:17:58,260 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:17:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1801981404, now seen corresponding path program 1 times [2018-11-18 12:17:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:17:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:17:58,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:17:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 23 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 12:17:58,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:58,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:17:58,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-11-18 12:17:58,348 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [504], [508], [514], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:17:58,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:17:58,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:17:58,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:17:58,632 INFO L272 AbstractInterpreter]: Visited 158 different actions 902 times. Merged at 55 different actions 187 times. Never widened. Performed 10427 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 28 fixpoints after 13 different actions. Largest state had 54 variables. [2018-11-18 12:17:58,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:17:58,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:17:58,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:17:58,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:17:58,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:17:58,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:17:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:17:58,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:17:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 12:17:58,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:17:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-18 12:17:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:17:59,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-11-18 12:17:59,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:17:59,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:17:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:17:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:17:59,045 INFO L87 Difference]: Start difference. First operand 20695 states and 28507 transitions. Second operand 6 states. [2018-11-18 12:18:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:00,272 INFO L93 Difference]: Finished difference Result 30867 states and 44779 transitions. [2018-11-18 12:18:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:18:00,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-11-18 12:18:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:00,313 INFO L225 Difference]: With dead ends: 30867 [2018-11-18 12:18:00,313 INFO L226 Difference]: Without dead ends: 20695 [2018-11-18 12:18:00,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 525 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:18:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20695 states. [2018-11-18 12:18:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20695 to 20683. [2018-11-18 12:18:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20683 states. [2018-11-18 12:18:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20683 states to 20683 states and 28476 transitions. [2018-11-18 12:18:01,676 INFO L78 Accepts]: Start accepts. Automaton has 20683 states and 28476 transitions. Word has length 265 [2018-11-18 12:18:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:01,676 INFO L480 AbstractCegarLoop]: Abstraction has 20683 states and 28476 transitions. [2018-11-18 12:18:01,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:18:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20683 states and 28476 transitions. [2018-11-18 12:18:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-18 12:18:01,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:01,682 INFO L375 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, 2, 2, 2, 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] [2018-11-18 12:18:01,682 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:01,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -364887982, now seen corresponding path program 1 times [2018-11-18 12:18:01,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:01,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:01,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:01,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 12:18:01,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:01,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:18:01,740 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-11-18 12:18:01,741 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [260], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [501], [508], [514], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:18:01,742 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:18:01,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:18:02,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:18:02,322 INFO L272 AbstractInterpreter]: Visited 159 different actions 1318 times. Merged at 54 different actions 284 times. Widened at 1 different actions 1 times. Performed 15315 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15315 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 46 fixpoints after 12 different actions. Largest state had 54 variables. [2018-11-18 12:18:02,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:02,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:18:02,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:02,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:18:02,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:02,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:18:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:02,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 12:18:02,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:18:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-18 12:18:02,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:02,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-18 12:18:02,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:02,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:18:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:18:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:18:02,601 INFO L87 Difference]: Start difference. First operand 20683 states and 28476 transitions. Second operand 6 states. [2018-11-18 12:18:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:03,988 INFO L93 Difference]: Finished difference Result 38645 states and 57420 transitions. [2018-11-18 12:18:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:18:03,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-11-18 12:18:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:04,037 INFO L225 Difference]: With dead ends: 38645 [2018-11-18 12:18:04,037 INFO L226 Difference]: Without dead ends: 20658 [2018-11-18 12:18:04,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 531 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:18:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20658 states. [2018-11-18 12:18:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20658 to 20658. [2018-11-18 12:18:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20658 states. [2018-11-18 12:18:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20658 states to 20658 states and 27882 transitions. [2018-11-18 12:18:05,429 INFO L78 Accepts]: Start accepts. Automaton has 20658 states and 27882 transitions. Word has length 266 [2018-11-18 12:18:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:05,430 INFO L480 AbstractCegarLoop]: Abstraction has 20658 states and 27882 transitions. [2018-11-18 12:18:05,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:18:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 20658 states and 27882 transitions. [2018-11-18 12:18:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-18 12:18:05,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:05,436 INFO L375 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, 2, 2, 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-11-18 12:18:05,436 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:05,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash 651868750, now seen corresponding path program 1 times [2018-11-18 12:18:05,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:05,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 12:18:05,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:05,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:18:05,491 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-11-18 12:18:05,491 INFO L202 CegarAbsIntRunner]: [2], [13], [19], [21], [29], [32], [34], [37], [43], [49], [51], [53], [55], [59], [90], [95], [109], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [184], [186], [188], [189], [239], [241], [244], [246], [249], [252], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [351], [354], [356], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [498], [501], [508], [514], [521], [524], [536], [539], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [637], [638], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:18:05,492 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:18:05,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:18:05,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:18:05,791 INFO L272 AbstractInterpreter]: Visited 158 different actions 1100 times. Merged at 54 different actions 197 times. Never widened. Performed 11281 root evaluator evaluations with a maximum evaluation depth of 3. Performed 11281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 37 fixpoints after 11 different actions. Largest state had 54 variables. [2018-11-18 12:18:05,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:05,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:18:05,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:05,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:18:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:05,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:18:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:05,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 12:18:05,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:18:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 12:18:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:06,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-11-18 12:18:06,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:06,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:18:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:18:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:18:06,056 INFO L87 Difference]: Start difference. First operand 20658 states and 27882 transitions. Second operand 6 states. [2018-11-18 12:18:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:07,253 INFO L93 Difference]: Finished difference Result 35388 states and 50280 transitions. [2018-11-18 12:18:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:18:07,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 266 [2018-11-18 12:18:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:07,295 INFO L225 Difference]: With dead ends: 35388 [2018-11-18 12:18:07,295 INFO L226 Difference]: Without dead ends: 16943 [2018-11-18 12:18:07,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 529 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-11-18 12:18:07,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16943 states. [2018-11-18 12:18:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16943 to 16943. [2018-11-18 12:18:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16943 states. [2018-11-18 12:18:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16943 states to 16943 states and 22228 transitions. [2018-11-18 12:18:08,419 INFO L78 Accepts]: Start accepts. Automaton has 16943 states and 22228 transitions. Word has length 266 [2018-11-18 12:18:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:08,419 INFO L480 AbstractCegarLoop]: Abstraction has 16943 states and 22228 transitions. [2018-11-18 12:18:08,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:18:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16943 states and 22228 transitions. [2018-11-18 12:18:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-18 12:18:08,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:08,428 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:18:08,428 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:08,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1579923498, now seen corresponding path program 1 times [2018-11-18 12:18:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:08,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:08,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-11-18 12:18:08,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:08,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:18:08,490 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-11-18 12:18:08,490 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [182], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [280], [283], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [491], [495], [501], [508], [511], [521], [524], [536], [539], [542], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [609], [610], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:18:08,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:18:08,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:18:08,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:18:08,532 INFO L272 AbstractInterpreter]: Visited 146 different actions 208 times. Merged at 12 different actions 12 times. Never widened. Performed 1638 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1638 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-11-18 12:18:08,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:08,534 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:18:08,654 INFO L227 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 74.77% of their original sizes. [2018-11-18 12:18:08,654 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:18:09,794 INFO L415 sIntCurrentIteration]: We unified 319 AI predicates to 319 [2018-11-18 12:18:09,794 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:18:09,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:18:09,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [4] total 81 [2018-11-18 12:18:09,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:09,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-11-18 12:18:09,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-18 12:18:09,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=5691, Unknown=0, NotChecked=0, Total=6162 [2018-11-18 12:18:09,796 INFO L87 Difference]: Start difference. First operand 16943 states and 22228 transitions. Second operand 79 states. [2018-11-18 12:18:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:29,939 INFO L93 Difference]: Finished difference Result 26474 states and 34745 transitions. [2018-11-18 12:18:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-11-18 12:18:29,939 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 320 [2018-11-18 12:18:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:29,963 INFO L225 Difference]: With dead ends: 26474 [2018-11-18 12:18:29,963 INFO L226 Difference]: Without dead ends: 14639 [2018-11-18 12:18:29,982 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 405 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1950, Invalid=25110, Unknown=0, NotChecked=0, Total=27060 [2018-11-18 12:18:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14639 states. [2018-11-18 12:18:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14639 to 12339. [2018-11-18 12:18:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12339 states. [2018-11-18 12:18:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12339 states to 12339 states and 14829 transitions. [2018-11-18 12:18:30,748 INFO L78 Accepts]: Start accepts. Automaton has 12339 states and 14829 transitions. Word has length 320 [2018-11-18 12:18:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:30,748 INFO L480 AbstractCegarLoop]: Abstraction has 12339 states and 14829 transitions. [2018-11-18 12:18:30,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-11-18 12:18:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12339 states and 14829 transitions. [2018-11-18 12:18:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-18 12:18:30,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:30,755 INFO L375 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, 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] [2018-11-18 12:18:30,755 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:30,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2013801345, now seen corresponding path program 1 times [2018-11-18 12:18:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:30,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 47 proven. 44 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-18 12:18:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:30,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:18:30,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 323 with the following transitions: [2018-11-18 12:18:30,817 INFO L202 CegarAbsIntRunner]: [32], [34], [37], [43], [49], [51], [53], [55], [59], [62], [64], [67], [73], [79], [81], [83], [85], [89], [90], [95], [109], [112], [117], [119], [121], [123], [124], [129], [135], [141], [147], [153], [159], [165], [171], [173], [174], [177], [180], [182], [184], [186], [188], [189], [239], [241], [244], [246], [249], [254], [257], [262], [265], [268], [270], [272], [274], [275], [278], [297], [298], [303], [309], [315], [321], [327], [333], [339], [345], [347], [348], [358], [360], [362], [363], [366], [372], [378], [384], [388], [389], [392], [394], [397], [403], [409], [411], [413], [417], [455], [458], [459], [460], [464], [470], [473], [476], [482], [485], [488], [495], [501], [508], [511], [521], [524], [536], [539], [542], [544], [546], [548], [550], [551], [552], [561], [567], [569], [599], [603], [604], [607], [608], [609], [610], [611], [612], [613], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [633], [634], [635], [636], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [673], [674], [675] [2018-11-18 12:18:30,818 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:18:30,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:18:31,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:18:31,009 INFO L272 AbstractInterpreter]: Visited 163 different actions 828 times. Merged at 60 different actions 132 times. Never widened. Performed 7488 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7488 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 22 fixpoints after 13 different actions. Largest state had 54 variables. [2018-11-18 12:18:31,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:31,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:18:31,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:18:31,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/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-11-18 12:18:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:31,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:18:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:31,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:18:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 12:18:31,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:18:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 47 proven. 44 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-18 12:18:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:18:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-11-18 12:18:31,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:31,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:18:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:18:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:18:31,375 INFO L87 Difference]: Start difference. First operand 12339 states and 14829 transitions. Second operand 4 states. [2018-11-18 12:18:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:31,851 INFO L93 Difference]: Finished difference Result 13615 states and 16316 transitions. [2018-11-18 12:18:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:18:31,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-11-18 12:18:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:31,855 INFO L225 Difference]: With dead ends: 13615 [2018-11-18 12:18:31,855 INFO L226 Difference]: Without dead ends: 1167 [2018-11-18 12:18:31,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 649 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-11-18 12:18:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-11-18 12:18:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1122. [2018-11-18 12:18:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-11-18 12:18:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1187 transitions. [2018-11-18 12:18:31,948 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1187 transitions. Word has length 322 [2018-11-18 12:18:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:31,949 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 1187 transitions. [2018-11-18 12:18:31,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:18:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1187 transitions. [2018-11-18 12:18:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-11-18 12:18:31,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:31,950 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:18:31,950 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:31,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash 287515981, now seen corresponding path program 1 times [2018-11-18 12:18:31,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:31,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-18 12:18:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:18:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:18:32,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:32,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:18:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:18:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:18:32,125 INFO L87 Difference]: Start difference. First operand 1122 states and 1187 transitions. Second operand 8 states. [2018-11-18 12:18:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:32,864 INFO L93 Difference]: Finished difference Result 1125 states and 1190 transitions. [2018-11-18 12:18:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:18:32,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 387 [2018-11-18 12:18:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:32,866 INFO L225 Difference]: With dead ends: 1125 [2018-11-18 12:18:32,866 INFO L226 Difference]: Without dead ends: 1122 [2018-11-18 12:18:32,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:18:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2018-11-18 12:18:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1121. [2018-11-18 12:18:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2018-11-18 12:18:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1185 transitions. [2018-11-18 12:18:32,947 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1185 transitions. Word has length 387 [2018-11-18 12:18:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:32,947 INFO L480 AbstractCegarLoop]: Abstraction has 1121 states and 1185 transitions. [2018-11-18 12:18:32,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:18:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1185 transitions. [2018-11-18 12:18:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-11-18 12:18:32,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:32,949 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:18:32,949 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:32,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 899543989, now seen corresponding path program 1 times [2018-11-18 12:18:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:32,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:18:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-11-18 12:18:33,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:18:33,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:18:33,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:18:33,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:18:33,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:18:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:18:33,031 INFO L87 Difference]: Start difference. First operand 1121 states and 1185 transitions. Second operand 3 states. [2018-11-18 12:18:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:18:33,139 INFO L93 Difference]: Finished difference Result 1547 states and 1642 transitions. [2018-11-18 12:18:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:18:33,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2018-11-18 12:18:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:18:33,142 INFO L225 Difference]: With dead ends: 1547 [2018-11-18 12:18:33,142 INFO L226 Difference]: Without dead ends: 1129 [2018-11-18 12:18:33,142 INFO L604 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-11-18 12:18:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-11-18 12:18:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2018-11-18 12:18:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-11-18 12:18:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1194 transitions. [2018-11-18 12:18:33,224 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1194 transitions. Word has length 391 [2018-11-18 12:18:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:18:33,224 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1194 transitions. [2018-11-18 12:18:33,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:18:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1194 transitions. [2018-11-18 12:18:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-11-18 12:18:33,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:18:33,226 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 12:18:33,226 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:18:33,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:18:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -949690443, now seen corresponding path program 1 times [2018-11-18 12:18:33,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:18:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:18:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:18:33,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:18:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:18:33,366 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:18:33,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:18:33 BoogieIcfgContainer [2018-11-18 12:18:33,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:18:33,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:18:33,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:18:33,533 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:18:33,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:46" (3/4) ... [2018-11-18 12:18:33,536 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:18:33,676 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d8c6d453-1b74-4cd4-8015-49e2638ca777/bin-2019/utaipan/witness.graphml [2018-11-18 12:18:33,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:18:33,677 INFO L168 Benchmark]: Toolchain (without parser) took 288362.77 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -54.2 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-18 12:18:33,679 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:33,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:33,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:33,680 INFO L168 Benchmark]: Boogie Preprocessor took 65.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:33,680 INFO L168 Benchmark]: RCFGBuilder took 427.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:18:33,680 INFO L168 Benchmark]: TraceAbstraction took 287474.24 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-18 12:18:33,680 INFO L168 Benchmark]: Witness Printer took 143.09 ms. Allocated memory is still 4.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:18:33,681 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 287474.24 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 143.09 ms. Allocated memory is still 4.9 GB. Free memory is still 1.0 GB. There was no memory consumed. 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 m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; VAL [\old(E_1)=21, \old(E_2)=6, \old(E_3)=25, \old(E_M)=16, \old(local)=20, \old(M_E)=17, \old(m_i)=8, \old(m_pc)=14, \old(m_st)=15, \old(T1_E)=4, \old(t1_i)=19, \old(t1_pc)=10, \old(t1_st)=5, \old(T2_E)=18, \old(t2_i)=7, \old(t2_pc)=11, \old(t2_st)=12, \old(T3_E)=22, \old(t3_i)=24, \old(t3_pc)=9, \old(t3_st)=13, \old(token)=23, E_1=2, E_2=2, E_3=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, token=0] [L725] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L729] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] RET t3_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L729] init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L730] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L673] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L674] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L294] COND TRUE m_i == 1 [L295] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L309] COND TRUE t3_i == 1 [L310] RET t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L674] init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L675] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L431] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L436] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L441] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L446] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L451] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L456] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L461] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L466] COND FALSE, RET !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L675] fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L676] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L210] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L222] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L531] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, token=0] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L241] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L539] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, tmp___0=0, token=0] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L260] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L547] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, tmp___0=0, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L279] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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, token=0] [L555] EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE, RET !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L676] activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L677] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L479] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L484] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L489] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L494] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L499] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L504] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L509] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L514] COND FALSE, RET !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L677] reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L680] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L683] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L684] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L350] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=1, E_1=2, E_2=2, E_3=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, token=0] [L345] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=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, token=0] [L357] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L384] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L102] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L113] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L115] t1_pc = 1 [L116] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L384] transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L398] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L138] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L149] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L151] t2_pc = 1 [L152] RET t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L398] transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L412] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L174] COND TRUE t3_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L185] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L187] t3_pc = 1 [L188] RET t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L412] transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=1, E_1=2, E_2=2, E_3=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, token=0] [L345] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=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, token=0] [L357] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L370] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp_var=0, token=0] [L57] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp_var=0, token=0] [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp_var=0, token=0] [L63] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L210] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L222] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L531] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, token=0] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=1, E_1=1, E_2=2, E_3=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, token=0] [L241] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_3=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, token=0] [L539] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, tmp___0=1, token=0] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L260] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L547] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, tmp___0=1, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, tmp___0=1, tmp___1=0, token=0] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L279] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=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, token=0] [L555] EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, tmp___0=1, tmp___1=0, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE, RET !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, token=0] [L63] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=1, E_2=2, E_3=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, tmp_var=0, token=0] [L64] E_1 = 2 [L65] m_pc = 1 [L66] RET m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp_var=0, token=0] [L370] master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L384] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L102] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L105] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=0] [L121] token += 1 [L122] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L123] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L211] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L222] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L531] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, token=1] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L241] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L539] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, token=1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, tmp___0=0, token=1] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=1, E_1=2, E_2=1, E_3=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, token=1] [L260] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=1, __retres1=1, E_1=2, E_2=1, E_3=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, token=1] [L547] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, tmp___0=0, token=1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, tmp___0=0, tmp___1=1, token=1] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L279] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, E_3=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, token=1] [L555] EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, tmp___0=0, tmp___1=1, token=1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE, RET !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L123] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=1, E_3=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, token=1] [L124] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=1] [L113] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=1] [L115] t1_pc = 1 [L116] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=1] [L384] transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L398] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=1] [L138] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=1] [L141] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=1] [L157] token += 1 [L158] E_3 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L159] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L211] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L531] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L539] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L547] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, __retres1=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L279] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L555] EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=1, 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, tmp=0, tmp___0=0, tmp___1=0, token=2] [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] RET t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L160] E_3 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=2] [L149] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=2] [L151] t2_pc = 1 [L152] RET t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=1, E_1=2, E_2=2, E_3=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, token=2] [L398] transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=2] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=2] [L412] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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, token=2] [L174] COND FALSE !(t3_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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, token=2] [L177] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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, token=2] [L193] token += 1 [L194] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L195] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, __retres1=1, E_1=2, E_2=2, E_3=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=1, token=3] [L222] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=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=1, token=3] [L531] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, token=3] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L241] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L539] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, token=3] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, tmp___0=0, token=3] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L260] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L547] EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, tmp___0=0, token=3] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L279] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=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=1, token=3] [L555] EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE, RET !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L195] immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L196] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L185] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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=1, token=3] [L187] t3_pc = 1 [L188] RET t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=2, E_1=2, E_2=2, E_3=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, token=3] [L412] transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=3] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, token=3] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, __retres1=1, E_1=2, E_2=2, E_3=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, token=3] [L345] RET return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=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, token=3] [L357] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=0, E_1=2, E_2=2, E_3=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L370] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, token=3] [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L49] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L71] COND FALSE !(token != local + 3) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L82] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L83] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L84] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, tmp_var=5, token=3] [L85] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, token=3] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=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(token)=3, E_1=2, E_2=2, E_3=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, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 217 locations, 1 error locations. UNSAFE Result, 287.4s OverallTime, 49 OverallIterations, 5 TraceHistogramMax, 232.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19134 SDtfs, 35059 SDslu, 147394 SDs, 0 SdLazy, 74574 SolverSat, 11435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.8s Time, PredicateUnifierStatistics: 30 DeclaredPredicates, 14935 GetRequests, 12715 SyntacticMatches, 98 SemanticMatches, 2122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111612 ImplicationChecksByTransitivity, 32.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27812occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.2s AbstIntTime, 34 AbstIntIterations, 15 AbstIntStrong, 0.9921075988950904 AbsIntWeakeningRatio, 0.608092485549133 AbsIntAvgWeakeningVarsNumRemoved, 20.072254335260116 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 25.8s AutomataMinimizationTime, 48 MinimizatonAttempts, 13264 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 16295 NumberOfCodeBlocks, 16295 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 20878 ConstructedInterpolants, 0 QuantifiedInterpolants, 7384358 SizeOfPredicates, 22 NumberOfNonLiveVariables, 22826 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 86 InterpolantComputations, 37 PerfectInterpolantSequences, 12581/13372 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...