./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:20:23,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:20:23,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:20:23,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:20:23,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:20:23,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:20:23,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:20:23,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:20:23,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:20:23,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:20:23,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:20:23,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:20:23,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:20:23,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:20:23,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:20:23,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:20:23,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:20:23,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:20:23,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:20:23,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:20:23,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:20:23,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:20:23,752 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:20:23,752 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:20:23,753 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:20:23,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:20:23,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:20:23,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:20:23,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:20:23,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:20:23,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:20:23,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:20:23,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:20:23,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:20:23,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:20:23,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:20:23,756 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:20:23,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:20:23,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:20:23,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:20:23,764 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:20:23,764 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:20:23,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:20:23,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:20:23,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:20:23,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:20:23,766 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:20:23,766 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_e060c747-3d13-4ae3-997b-713611540d20/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-12-02 20:20:23,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:20:23,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:20:23,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:20:23,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:20:23,792 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:20:23,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-02 20:20:23,826 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/data/6ae44a13c/78aa75685ea246ba97c7633369860acf/FLAGe7b254c43 [2018-12-02 20:20:24,117 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:20:24,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-02 20:20:24,122 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/data/6ae44a13c/78aa75685ea246ba97c7633369860acf/FLAGe7b254c43 [2018-12-02 20:20:24,554 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/data/6ae44a13c/78aa75685ea246ba97c7633369860acf [2018-12-02 20:20:24,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:20:24,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:20:24,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:20:24,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:20:24,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:20:24,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161b79d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24, skipping insertion in model container [2018-12-02 20:20:24,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:20:24,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:20:24,684 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:20:24,687 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:20:24,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:20:24,715 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:20:24,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24 WrapperNode [2018-12-02 20:20:24,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:20:24,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:20:24,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:20:24,716 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:20:24,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:20:24,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:20:24,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:20:24,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:20:24,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... [2018-12-02 20:20:24,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:20:24,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:20:24,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:20:24,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:20:24,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:20:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-02 20:20:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-02 20:20:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-02 20:20:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-02 20:20:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-02 20:20:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-02 20:20:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-02 20:20:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-02 20:20:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-02 20:20:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-02 20:20:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-02 20:20:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-02 20:20:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-02 20:20:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-02 20:20:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:20:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:20:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-02 20:20:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-02 20:20:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-02 20:20:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-02 20:20:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-02 20:20:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-02 20:20:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:20:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:20:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-02 20:20:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-02 20:20:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-02 20:20:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-02 20:20:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-02 20:20:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-02 20:20:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-02 20:20:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-02 20:20:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-02 20:20:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-02 20:20:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-02 20:20:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-02 20:20:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:20:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:20:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-02 20:20:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-02 20:20:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-02 20:20:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-02 20:20:25,042 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:20:25,042 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-02 20:20:25,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:25 BoogieIcfgContainer [2018-12-02 20:20:25,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:20:25,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:20:25,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:20:25,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:20:25,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:20:24" (1/3) ... [2018-12-02 20:20:25,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4d4a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:25, skipping insertion in model container [2018-12-02 20:20:25,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:20:24" (2/3) ... [2018-12-02 20:20:25,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4d4a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:20:25, skipping insertion in model container [2018-12-02 20:20:25,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:25" (3/3) ... [2018-12-02 20:20:25,047 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-02 20:20:25,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:20:25,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:20:25,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:20:25,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:20:25,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:20:25,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:20:25,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:20:25,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:20:25,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:20:25,087 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:20:25,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:20:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-12-02 20:20:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:25,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:25,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:25,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:25,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 984093551, now seen corresponding path program 1 times [2018-12-02 20:20:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:25,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:25,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:25,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:25,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:25,292 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-12-02 20:20:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:25,563 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2018-12-02 20:20:25,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:20:25,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:25,572 INFO L225 Difference]: With dead ends: 312 [2018-12-02 20:20:25,572 INFO L226 Difference]: Without dead ends: 168 [2018-12-02 20:20:25,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-02 20:20:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2018-12-02 20:20:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 20:20:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2018-12-02 20:20:25,612 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 78 [2018-12-02 20:20:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:25,612 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2018-12-02 20:20:25,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2018-12-02 20:20:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:25,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:25,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:25,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:25,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1024768301, now seen corresponding path program 1 times [2018-12-02 20:20:25,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:25,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:25,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:25,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:25,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:25,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:25,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:25,690 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand 5 states. [2018-12-02 20:20:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:25,897 INFO L93 Difference]: Finished difference Result 305 states and 422 transitions. [2018-12-02 20:20:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:20:25,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:25,899 INFO L225 Difference]: With dead ends: 305 [2018-12-02 20:20:25,899 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 20:20:25,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 20:20:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-12-02 20:20:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 20:20:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2018-12-02 20:20:25,914 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 78 [2018-12-02 20:20:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:25,915 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2018-12-02 20:20:25,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2018-12-02 20:20:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:25,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:25,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:25,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:25,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1883413585, now seen corresponding path program 1 times [2018-12-02 20:20:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:25,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:25,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:25,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:25,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:25,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:25,970 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand 5 states. [2018-12-02 20:20:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:26,165 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2018-12-02 20:20:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:20:26,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:26,166 INFO L225 Difference]: With dead ends: 299 [2018-12-02 20:20:26,167 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 20:20:26,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 20:20:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2018-12-02 20:20:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 20:20:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2018-12-02 20:20:26,183 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 78 [2018-12-02 20:20:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:26,183 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2018-12-02 20:20:26,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2018-12-02 20:20:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:26,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:26,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:26,185 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:26,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1007394579, now seen corresponding path program 1 times [2018-12-02 20:20:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:26,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:26,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:26,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:20:26,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:26,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:20:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:20:26,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:26,223 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 6 states. [2018-12-02 20:20:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:26,250 INFO L93 Difference]: Finished difference Result 274 states and 372 transitions. [2018-12-02 20:20:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:20:26,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 20:20:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:26,252 INFO L225 Difference]: With dead ends: 274 [2018-12-02 20:20:26,252 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 20:20:26,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:20:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 20:20:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-12-02 20:20:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 20:20:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2018-12-02 20:20:26,262 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 78 [2018-12-02 20:20:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:26,263 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2018-12-02 20:20:26,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:20:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2018-12-02 20:20:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:26,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:26,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:26,264 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:26,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -583747857, now seen corresponding path program 1 times [2018-12-02 20:20:26,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:26,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-12-02 20:20:26,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:26,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:20:26,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:26,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:20:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:20:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:26,300 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 6 states. [2018-12-02 20:20:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:26,330 INFO L93 Difference]: Finished difference Result 281 states and 377 transitions. [2018-12-02 20:20:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:20:26,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 20:20:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:26,332 INFO L225 Difference]: With dead ends: 281 [2018-12-02 20:20:26,332 INFO L226 Difference]: Without dead ends: 154 [2018-12-02 20:20:26,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:20:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-02 20:20:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-12-02 20:20:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 20:20:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2018-12-02 20:20:26,345 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 78 [2018-12-02 20:20:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:26,346 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2018-12-02 20:20:26,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:20:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2018-12-02 20:20:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:26,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:26,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:26,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:26,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -308988243, now seen corresponding path program 1 times [2018-12-02 20:20:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:26,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:26,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:26,424 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 5 states. [2018-12-02 20:20:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:26,633 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2018-12-02 20:20:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:20:26,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:26,635 INFO L225 Difference]: With dead ends: 352 [2018-12-02 20:20:26,635 INFO L226 Difference]: Without dead ends: 221 [2018-12-02 20:20:26,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:20:26,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-02 20:20:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2018-12-02 20:20:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-02 20:20:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2018-12-02 20:20:26,650 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 78 [2018-12-02 20:20:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:26,651 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2018-12-02 20:20:26,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2018-12-02 20:20:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:26,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:26,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:26,652 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:26,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash -818461333, now seen corresponding path program 1 times [2018-12-02 20:20:26,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:26,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:26,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:26,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:26,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:26,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:26,710 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand 5 states. [2018-12-02 20:20:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:26,864 INFO L93 Difference]: Finished difference Result 377 states and 490 transitions. [2018-12-02 20:20:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:20:26,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:26,865 INFO L225 Difference]: With dead ends: 377 [2018-12-02 20:20:26,865 INFO L226 Difference]: Without dead ends: 200 [2018-12-02 20:20:26,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-02 20:20:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-02 20:20:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-02 20:20:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 255 transitions. [2018-12-02 20:20:26,875 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 255 transitions. Word has length 78 [2018-12-02 20:20:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:26,875 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 255 transitions. [2018-12-02 20:20:26,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2018-12-02 20:20:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:26,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:26,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:26,876 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:26,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1104766701, now seen corresponding path program 1 times [2018-12-02 20:20:26,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:26,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:26,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:26,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:26,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:26,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:26,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:26,912 INFO L87 Difference]: Start difference. First operand 200 states and 255 transitions. Second operand 5 states. [2018-12-02 20:20:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:27,136 INFO L93 Difference]: Finished difference Result 461 states and 625 transitions. [2018-12-02 20:20:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:20:27,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:27,138 INFO L225 Difference]: With dead ends: 461 [2018-12-02 20:20:27,138 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 20:20:27,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:20:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 20:20:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 226. [2018-12-02 20:20:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 20:20:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 282 transitions. [2018-12-02 20:20:27,153 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 282 transitions. Word has length 78 [2018-12-02 20:20:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:27,153 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 282 transitions. [2018-12-02 20:20:27,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 282 transitions. [2018-12-02 20:20:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:27,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:27,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:27,154 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:27,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1166806315, now seen corresponding path program 1 times [2018-12-02 20:20:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:27,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:27,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:20:27,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:27,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:20:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:20:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:20:27,200 INFO L87 Difference]: Start difference. First operand 226 states and 282 transitions. Second operand 5 states. [2018-12-02 20:20:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:27,408 INFO L93 Difference]: Finished difference Result 483 states and 644 transitions. [2018-12-02 20:20:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:20:27,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 20:20:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:27,410 INFO L225 Difference]: With dead ends: 483 [2018-12-02 20:20:27,410 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 20:20:27,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:20:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 20:20:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 241. [2018-12-02 20:20:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-02 20:20:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2018-12-02 20:20:27,431 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 78 [2018-12-02 20:20:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:27,431 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2018-12-02 20:20:27,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:20:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2018-12-02 20:20:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 20:20:27,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:27,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:27,432 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1307354925, now seen corresponding path program 1 times [2018-12-02 20:20:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:20:27,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:27,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:20:27,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:27,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:20:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:20:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:20:27,460 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand 3 states. [2018-12-02 20:20:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:27,500 INFO L93 Difference]: Finished difference Result 652 states and 821 transitions. [2018-12-02 20:20:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:20:27,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-02 20:20:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:27,502 INFO L225 Difference]: With dead ends: 652 [2018-12-02 20:20:27,503 INFO L226 Difference]: Without dead ends: 432 [2018-12-02 20:20:27,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:20:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-02 20:20:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 429. [2018-12-02 20:20:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-12-02 20:20:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 524 transitions. [2018-12-02 20:20:27,530 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 524 transitions. Word has length 78 [2018-12-02 20:20:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:27,530 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 524 transitions. [2018-12-02 20:20:27,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:20:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 524 transitions. [2018-12-02 20:20:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 20:20:27,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:27,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:20:27,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:27,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1619852214, now seen corresponding path program 1 times [2018-12-02 20:20:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 20:20:27,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:27,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:20:27,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:27,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:20:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:20:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:20:27,556 INFO L87 Difference]: Start difference. First operand 429 states and 524 transitions. Second operand 4 states. [2018-12-02 20:20:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:27,709 INFO L93 Difference]: Finished difference Result 1175 states and 1446 transitions. [2018-12-02 20:20:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:20:27,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 20:20:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:27,711 INFO L225 Difference]: With dead ends: 1175 [2018-12-02 20:20:27,711 INFO L226 Difference]: Without dead ends: 605 [2018-12-02 20:20:27,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:20:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-02 20:20:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 585. [2018-12-02 20:20:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-12-02 20:20:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 696 transitions. [2018-12-02 20:20:27,741 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 696 transitions. Word has length 123 [2018-12-02 20:20:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:27,741 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 696 transitions. [2018-12-02 20:20:27,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:20:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 696 transitions. [2018-12-02 20:20:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 20:20:27,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:27,743 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 20:20:27,743 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:27,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -215959123, now seen corresponding path program 1 times [2018-12-02 20:20:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:27,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 20:20:27,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:20:27,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:20:27,801 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-12-02 20:20:27,802 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [125], [128], [130], [133], [144], [146], [148], [152], [190], [193], [194], [206], [215], [218], [221], [227], [230], [240], [243], [255], [269], [271], [305], [311], [317], [323], [325], [326], [327], [330], [333], [337], [339], [341], [342], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [385], [386], [387], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [429], [430], [431] [2018-12-02 20:20:27,826 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:20:27,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:20:27,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:20:27,962 INFO L272 AbstractInterpreter]: Visited 91 different actions 113 times. Never merged. Never widened. Performed 636 root evaluator evaluations with a maximum evaluation depth of 3. Performed 636 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-12-02 20:20:27,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:27,967 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:20:28,086 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 77.41% of their original sizes. [2018-12-02 20:20:28,086 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:20:28,409 INFO L418 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2018-12-02 20:20:28,410 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:20:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:20:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-12-02 20:20:28,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:28,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 20:20:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 20:20:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 20:20:28,411 INFO L87 Difference]: Start difference. First operand 585 states and 696 transitions. Second operand 40 states. [2018-12-02 20:20:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:32,686 INFO L93 Difference]: Finished difference Result 1395 states and 1678 transitions. [2018-12-02 20:20:32,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 20:20:32,686 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 158 [2018-12-02 20:20:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:32,688 INFO L225 Difference]: With dead ends: 1395 [2018-12-02 20:20:32,688 INFO L226 Difference]: Without dead ends: 826 [2018-12-02 20:20:32,690 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=671, Invalid=5029, Unknown=0, NotChecked=0, Total=5700 [2018-12-02 20:20:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-02 20:20:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 816. [2018-12-02 20:20:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-12-02 20:20:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 947 transitions. [2018-12-02 20:20:32,725 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 947 transitions. Word has length 158 [2018-12-02 20:20:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:32,725 INFO L480 AbstractCegarLoop]: Abstraction has 816 states and 947 transitions. [2018-12-02 20:20:32,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 20:20:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 947 transitions. [2018-12-02 20:20:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 20:20:32,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:32,727 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 20:20:32,727 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:32,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1404989915, now seen corresponding path program 1 times [2018-12-02 20:20:32,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:32,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-02 20:20:32,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:20:32,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:20:32,760 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-12-02 20:20:32,760 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [54], [57], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [125], [128], [130], [133], [144], [146], [148], [152], [190], [193], [194], [206], [215], [218], [221], [227], [230], [236], [240], [243], [255], [269], [271], [305], [311], [317], [323], [325], [326], [327], [330], [333], [337], [339], [341], [342], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [385], [386], [387], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [429], [430], [431] [2018-12-02 20:20:32,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:20:32,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:20:32,803 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:20:32,803 INFO L272 AbstractInterpreter]: Visited 99 different actions 129 times. Merged at 2 different actions 2 times. Never widened. Performed 751 root evaluator evaluations with a maximum evaluation depth of 3. Performed 751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 20:20:32,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:32,807 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:20:32,909 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 78% of their original sizes. [2018-12-02 20:20:32,909 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:20:33,319 INFO L418 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-12-02 20:20:33,319 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:20:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:20:33,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [4] total 54 [2018-12-02 20:20:33,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:33,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 20:20:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 20:20:33,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 20:20:33,320 INFO L87 Difference]: Start difference. First operand 816 states and 947 transitions. Second operand 52 states. [2018-12-02 20:20:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:37,294 INFO L93 Difference]: Finished difference Result 1510 states and 1787 transitions. [2018-12-02 20:20:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 20:20:37,294 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 177 [2018-12-02 20:20:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:37,296 INFO L225 Difference]: With dead ends: 1510 [2018-12-02 20:20:37,296 INFO L226 Difference]: Without dead ends: 649 [2018-12-02 20:20:37,298 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=888, Invalid=6768, Unknown=0, NotChecked=0, Total=7656 [2018-12-02 20:20:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-02 20:20:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2018-12-02 20:20:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-02 20:20:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 749 transitions. [2018-12-02 20:20:37,330 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 749 transitions. Word has length 177 [2018-12-02 20:20:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:37,330 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 749 transitions. [2018-12-02 20:20:37,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 20:20:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 749 transitions. [2018-12-02 20:20:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 20:20:37,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:37,332 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 20:20:37,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:37,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 791534044, now seen corresponding path program 1 times [2018-12-02 20:20:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:37,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 20:20:37,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:20:37,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:20:37,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-12-02 20:20:37,379 INFO L205 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [125], [128], [130], [133], [144], [146], [148], [152], [190], [193], [194], [206], [215], [218], [221], [227], [230], [233], [240], [243], [255], [269], [271], [305], [311], [317], [323], [325], [326], [327], [330], [333], [337], [339], [341], [342], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [385], [386], [387], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [429], [430], [431] [2018-12-02 20:20:37,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:20:37,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:20:37,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:20:37,447 INFO L272 AbstractInterpreter]: Visited 105 different actions 286 times. Merged at 17 different actions 27 times. Never widened. Performed 2732 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2732 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 30 variables. [2018-12-02 20:20:37,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:37,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:20:37,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:20:37,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:20:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:37,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:20:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:37,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:20:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 20:20:37,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:20:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-02 20:20:37,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:20:37,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-12-02 20:20:37,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:20:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:20:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:20:37,687 INFO L87 Difference]: Start difference. First operand 641 states and 749 transitions. Second operand 3 states. [2018-12-02 20:20:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:37,740 INFO L93 Difference]: Finished difference Result 1207 states and 1476 transitions. [2018-12-02 20:20:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:20:37,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-12-02 20:20:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:37,743 INFO L225 Difference]: With dead ends: 1207 [2018-12-02 20:20:37,743 INFO L226 Difference]: Without dead ends: 641 [2018-12-02 20:20:37,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 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-12-02 20:20:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-12-02 20:20:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2018-12-02 20:20:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-12-02 20:20:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 728 transitions. [2018-12-02 20:20:37,777 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 728 transitions. Word has length 177 [2018-12-02 20:20:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:37,778 INFO L480 AbstractCegarLoop]: Abstraction has 638 states and 728 transitions. [2018-12-02 20:20:37,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:20:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 728 transitions. [2018-12-02 20:20:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 20:20:37,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:37,779 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 20:20:37,779 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:37,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash 596046296, now seen corresponding path program 1 times [2018-12-02 20:20:37,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:37,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:37,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 20:20:37,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:37,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:20:37,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:37,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:20:37,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:20:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:20:37,885 INFO L87 Difference]: Start difference. First operand 638 states and 728 transitions. Second operand 6 states. [2018-12-02 20:20:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:38,381 INFO L93 Difference]: Finished difference Result 1080 states and 1299 transitions. [2018-12-02 20:20:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:20:38,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-12-02 20:20:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:38,384 INFO L225 Difference]: With dead ends: 1080 [2018-12-02 20:20:38,384 INFO L226 Difference]: Without dead ends: 1073 [2018-12-02 20:20:38,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:20:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-12-02 20:20:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1021. [2018-12-02 20:20:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-12-02 20:20:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1201 transitions. [2018-12-02 20:20:38,432 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1201 transitions. Word has length 178 [2018-12-02 20:20:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:38,432 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1201 transitions. [2018-12-02 20:20:38,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:20:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1201 transitions. [2018-12-02 20:20:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 20:20:38,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:38,434 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 20:20:38,434 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:38,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1762903808, now seen corresponding path program 1 times [2018-12-02 20:20:38,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:38,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:38,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:38,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:20:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-02 20:20:38,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:20:38,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:20:38,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:20:38,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:20:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:20:38,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:20:38,461 INFO L87 Difference]: Start difference. First operand 1021 states and 1201 transitions. Second operand 3 states. [2018-12-02 20:20:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:20:38,516 INFO L93 Difference]: Finished difference Result 1909 states and 2285 transitions. [2018-12-02 20:20:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:20:38,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-12-02 20:20:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:20:38,519 INFO L225 Difference]: With dead ends: 1909 [2018-12-02 20:20:38,519 INFO L226 Difference]: Without dead ends: 1028 [2018-12-02 20:20:38,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:20:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-12-02 20:20:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2018-12-02 20:20:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-12-02 20:20:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1211 transitions. [2018-12-02 20:20:38,567 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1211 transitions. Word has length 182 [2018-12-02 20:20:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:20:38,568 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1211 transitions. [2018-12-02 20:20:38,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:20:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1211 transitions. [2018-12-02 20:20:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 20:20:38,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:20:38,569 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 20:20:38,569 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:20:38,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:20:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash 44629755, now seen corresponding path program 1 times [2018-12-02 20:20:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:20:38,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:20:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:20:38,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:20:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:20:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:20:38,613 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:20:38,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:20:38 BoogieIcfgContainer [2018-12-02 20:20:38,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:20:38,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:20:38,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:20:38,667 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:20:38,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:20:25" (3/4) ... [2018-12-02 20:20:38,669 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:20:38,733 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e060c747-3d13-4ae3-997b-713611540d20/bin-2019/utaipan/witness.graphml [2018-12-02 20:20:38,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:20:38,733 INFO L168 Benchmark]: Toolchain (without parser) took 14176.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -60.9 MB). Peak memory consumption was 385.8 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,734 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:20:38,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 936.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory was 936.3 MB in the beginning and 933.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,735 INFO L168 Benchmark]: Boogie Preprocessor took 49.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,735 INFO L168 Benchmark]: RCFGBuilder took 264.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,735 INFO L168 Benchmark]: TraceAbstraction took 13623.72 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.8 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,735 INFO L168 Benchmark]: Witness Printer took 65.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:20:38,736 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 936.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.18 ms. Allocated memory is still 1.0 GB. Free memory was 936.3 MB in the beginning and 933.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13623.72 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.8 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, E_1=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, token=0] [L475] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L479] CALL init_model() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L390] m_i = 1 [L391] t1_i = 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L479] RET init_model() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L424] CALL init_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L424] RET init_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=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, token=0] [L138] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=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, token=0] [L157] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L434] CALL eval() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L208] int tmp ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=0] [L203] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L242] RET transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=0] [L203] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=1, 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, token=0] [L138] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=1, 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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=1, 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, token=0] [L157] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=1, 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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, __retres1=1, E_1=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=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, \result=1, __retres1=1, E_1=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=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, __retres1=0, E_1=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=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, \result=0, __retres1=0, E_1=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=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=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, token=1] [L242] RET transmit1() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, token=1] [L187] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=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, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=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, token=1] [L203] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=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, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=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(token)=1, E_1=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, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=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(token)=1, E_1=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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. UNSAFE Result, 13.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3449 SDtfs, 4404 SDslu, 9908 SDs, 0 SdLazy, 5056 SolverSat, 1523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 878 GetRequests, 637 SyntacticMatches, 27 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.983675938675938 AbsIntWeakeningRatio, 0.5495495495495496 AbsIntAvgWeakeningVarsNumRemoved, 13.612612612612613 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 317 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2135 NumberOfCodeBlocks, 2135 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2111 ConstructedInterpolants, 0 QuantifiedInterpolants, 412504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 715 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 712/757 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...