./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer --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 Automizer --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-1dbac8b [2018-11-10 13:13:49,549 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:13:49,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:13:49,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:13:49,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:13:49,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:13:49,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:13:49,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:13:49,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:13:49,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:13:49,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:13:49,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:13:49,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:13:49,565 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:13:49,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:13:49,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:13:49,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:13:49,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:13:49,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:13:49,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:13:49,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:13:49,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:13:49,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:13:49,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:13:49,576 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:13:49,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:13:49,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:13:49,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:13:49,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:13:49,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:13:49,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:13:49,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:13:49,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:13:49,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:13:49,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:13:49,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:13:49,582 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 13:13:49,592 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:13:49,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:13:49,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:13:49,593 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:13:49,593 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:13:49,593 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:13:49,593 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:13:49,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:13:49,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:13:49,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:13:49,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:13:49,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:13:49,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:13:49,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:13:49,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:13:49,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:13:49,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:13:49,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:13:49,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-11-10 13:13:49,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:13:49,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:13:49,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:13:49,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:13:49,639 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:13:49,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 13:13:49,685 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/data/9b1b22268/55fed01c16b943aaa207d572a2603dff/FLAGf86c8fdec [2018-11-10 13:13:50,026 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:13:50,027 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 13:13:50,034 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/data/9b1b22268/55fed01c16b943aaa207d572a2603dff/FLAGf86c8fdec [2018-11-10 13:13:50,046 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/data/9b1b22268/55fed01c16b943aaa207d572a2603dff [2018-11-10 13:13:50,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:13:50,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 13:13:50,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:13:50,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:13:50,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:13:50,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7446bff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50, skipping insertion in model container [2018-11-10 13:13:50,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:13:50,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:13:50,230 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:13:50,232 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:13:50,254 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:13:50,263 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:13:50,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50 WrapperNode [2018-11-10 13:13:50,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:13:50,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:13:50,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:13:50,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:13:50,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... [2018-11-10 13:13:50,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:13:50,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:13:50,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:13:50,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:13:50,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 13:13:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 13:13:50,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-10 13:13:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 13:13:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 13:13:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:13:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:13:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:13:50,666 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:13:50,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:13:50 BoogieIcfgContainer [2018-11-10 13:13:50,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:13:50,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:13:50,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:13:50,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:13:50,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:13:50" (1/3) ... [2018-11-10 13:13:50,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534348d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:13:50, skipping insertion in model container [2018-11-10 13:13:50,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:13:50" (2/3) ... [2018-11-10 13:13:50,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534348d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:13:50, skipping insertion in model container [2018-11-10 13:13:50,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:13:50" (3/3) ... [2018-11-10 13:13:50,672 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 13:13:50,677 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:13:50,682 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:13:50,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:13:50,710 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:13:50,711 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:13:50,711 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:13:50,711 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:13:50,711 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:13:50,711 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:13:50,711 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:13:50,711 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:13:50,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:13:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-11-10 13:13:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:50,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:50,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:50,730 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:50,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1964938671, now seen corresponding path program 1 times [2018-11-10 13:13:50,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:50,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:50,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:50,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:50,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:50,968 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2018-11-10 13:13:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:51,367 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2018-11-10 13:13:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:13:51,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:51,377 INFO L225 Difference]: With dead ends: 321 [2018-11-10 13:13:51,377 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 13:13:51,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 13:13:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-10 13:13:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 13:13:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2018-11-10 13:13:51,428 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 80 [2018-11-10 13:13:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:51,428 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2018-11-10 13:13:51,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-11-10 13:13:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:51,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:51,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:51,431 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:51,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1404238893, now seen corresponding path program 1 times [2018-11-10 13:13:51,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:51,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:51,538 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand 5 states. [2018-11-10 13:13:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:51,818 INFO L93 Difference]: Finished difference Result 300 states and 409 transitions. [2018-11-10 13:13:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:13:51,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:51,821 INFO L225 Difference]: With dead ends: 300 [2018-11-10 13:13:51,821 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 13:13:51,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 13:13:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-10 13:13:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 13:13:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2018-11-10 13:13:51,841 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 80 [2018-11-10 13:13:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:51,841 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2018-11-10 13:13:51,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2018-11-10 13:13:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:51,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:51,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:51,843 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:51,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -970509807, now seen corresponding path program 1 times [2018-11-10 13:13:51,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:51,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:51,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:51,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:51,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:51,914 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand 5 states. [2018-11-10 13:13:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:52,128 INFO L93 Difference]: Finished difference Result 316 states and 431 transitions. [2018-11-10 13:13:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:13:52,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:52,130 INFO L225 Difference]: With dead ends: 316 [2018-11-10 13:13:52,130 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 13:13:52,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 13:13:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2018-11-10 13:13:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 13:13:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-11-10 13:13:52,146 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 80 [2018-11-10 13:13:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:52,146 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-11-10 13:13:52,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-10 13:13:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:52,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:52,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:52,151 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:52,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash 290407443, now seen corresponding path program 1 times [2018-11-10 13:13:52,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:52,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:52,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:52,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:52,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:52,221 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 5 states. [2018-11-10 13:13:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:52,489 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions. [2018-11-10 13:13:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:13:52,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:52,492 INFO L225 Difference]: With dead ends: 309 [2018-11-10 13:13:52,492 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 13:13:52,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 13:13:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-11-10 13:13:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 13:13:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2018-11-10 13:13:52,508 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 80 [2018-11-10 13:13:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:52,509 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2018-11-10 13:13:52,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2018-11-10 13:13:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:52,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:52,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:52,510 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:52,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 331082193, now seen corresponding path program 1 times [2018-11-10 13:13:52,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:52,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:13:52,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:13:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:13:52,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:52,558 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand 6 states. [2018-11-10 13:13:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:52,588 INFO L93 Difference]: Finished difference Result 282 states and 378 transitions. [2018-11-10 13:13:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:13:52,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-10 13:13:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:52,591 INFO L225 Difference]: With dead ends: 282 [2018-11-10 13:13:52,591 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 13:13:52,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:13:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 13:13:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2018-11-10 13:13:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 13:13:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2018-11-10 13:13:52,604 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 80 [2018-11-10 13:13:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:52,605 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2018-11-10 13:13:52,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:13:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2018-11-10 13:13:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:52,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:52,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:52,606 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:52,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -566311085, now seen corresponding path program 1 times [2018-11-10 13:13:52,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:52,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:52,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:13:52,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:13:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:13:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:13:52,656 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand 4 states. [2018-11-10 13:13:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:52,802 INFO L93 Difference]: Finished difference Result 406 states and 542 transitions. [2018-11-10 13:13:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:13:52,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 13:13:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:52,805 INFO L225 Difference]: With dead ends: 406 [2018-11-10 13:13:52,806 INFO L226 Difference]: Without dead ends: 275 [2018-11-10 13:13:52,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:13:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-10 13:13:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2018-11-10 13:13:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 13:13:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 344 transitions. [2018-11-10 13:13:52,833 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 344 transitions. Word has length 80 [2018-11-10 13:13:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:52,834 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 344 transitions. [2018-11-10 13:13:52,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:13:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 344 transitions. [2018-11-10 13:13:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:52,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:52,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:52,836 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:52,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -166319886, now seen corresponding path program 1 times [2018-11-10 13:13:52,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:13:52,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:13:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:13:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:52,885 INFO L87 Difference]: Start difference. First operand 268 states and 344 transitions. Second operand 6 states. [2018-11-10 13:13:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:52,923 INFO L93 Difference]: Finished difference Result 523 states and 689 transitions. [2018-11-10 13:13:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:13:52,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-10 13:13:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:52,925 INFO L225 Difference]: With dead ends: 523 [2018-11-10 13:13:52,926 INFO L226 Difference]: Without dead ends: 275 [2018-11-10 13:13:52,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:13:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-10 13:13:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-11-10 13:13:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 13:13:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 348 transitions. [2018-11-10 13:13:52,942 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 348 transitions. Word has length 80 [2018-11-10 13:13:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:52,942 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 348 transitions. [2018-11-10 13:13:52,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:13:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 348 transitions. [2018-11-10 13:13:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:52,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:52,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:52,944 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:52,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1884664112, now seen corresponding path program 1 times [2018-11-10 13:13:52,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:52,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:52,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:53,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:53,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:53,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:53,006 INFO L87 Difference]: Start difference. First operand 273 states and 348 transitions. Second operand 5 states. [2018-11-10 13:13:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:53,214 INFO L93 Difference]: Finished difference Result 629 states and 809 transitions. [2018-11-10 13:13:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:13:53,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:53,216 INFO L225 Difference]: With dead ends: 629 [2018-11-10 13:13:53,216 INFO L226 Difference]: Without dead ends: 377 [2018-11-10 13:13:53,217 INFO L605 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-11-10 13:13:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-10 13:13:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 333. [2018-11-10 13:13:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-10 13:13:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 412 transitions. [2018-11-10 13:13:53,237 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 412 transitions. Word has length 80 [2018-11-10 13:13:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:53,237 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 412 transitions. [2018-11-10 13:13:53,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 412 transitions. [2018-11-10 13:13:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:53,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:53,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:53,238 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:53,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1907296366, now seen corresponding path program 1 times [2018-11-10 13:13:53,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:53,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:53,299 INFO L87 Difference]: Start difference. First operand 333 states and 412 transitions. Second operand 5 states. [2018-11-10 13:13:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:53,465 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2018-11-10 13:13:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:13:53,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:53,467 INFO L225 Difference]: With dead ends: 645 [2018-11-10 13:13:53,467 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 13:13:53,468 INFO L605 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-11-10 13:13:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 13:13:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-11-10 13:13:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-10 13:13:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2018-11-10 13:13:53,488 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 80 [2018-11-10 13:13:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:53,488 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2018-11-10 13:13:53,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2018-11-10 13:13:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:53,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:53,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:53,490 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:53,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1001467536, now seen corresponding path program 1 times [2018-11-10 13:13:53,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:53,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:53,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:53,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:53,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:13:53,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:13:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:13:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:13:53,553 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand 5 states. [2018-11-10 13:13:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:54,191 INFO L93 Difference]: Finished difference Result 757 states and 974 transitions. [2018-11-10 13:13:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:13:54,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-10 13:13:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:54,194 INFO L225 Difference]: With dead ends: 757 [2018-11-10 13:13:54,194 INFO L226 Difference]: Without dead ends: 445 [2018-11-10 13:13:54,195 INFO L605 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-11-10 13:13:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-11-10 13:13:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 380. [2018-11-10 13:13:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-10 13:13:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 456 transitions. [2018-11-10 13:13:54,223 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 456 transitions. Word has length 80 [2018-11-10 13:13:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:54,223 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 456 transitions. [2018-11-10 13:13:54,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:13:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 456 transitions. [2018-11-10 13:13:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:13:54,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:54,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:54,224 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:54,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash 921760498, now seen corresponding path program 1 times [2018-11-10 13:13:54,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:54,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:13:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:13:54,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:13:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:13:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:13:54,270 INFO L87 Difference]: Start difference. First operand 380 states and 456 transitions. Second operand 3 states. [2018-11-10 13:13:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:54,323 INFO L93 Difference]: Finished difference Result 1043 states and 1299 transitions. [2018-11-10 13:13:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:13:54,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-10 13:13:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:54,327 INFO L225 Difference]: With dead ends: 1043 [2018-11-10 13:13:54,328 INFO L226 Difference]: Without dead ends: 683 [2018-11-10 13:13:54,329 INFO L605 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-11-10 13:13:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-10 13:13:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2018-11-10 13:13:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-10 13:13:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 822 transitions. [2018-11-10 13:13:54,378 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 822 transitions. Word has length 80 [2018-11-10 13:13:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:54,378 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 822 transitions. [2018-11-10 13:13:54,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:13:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 822 transitions. [2018-11-10 13:13:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:13:54,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:54,380 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:54,380 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:54,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1313684767, now seen corresponding path program 1 times [2018-11-10 13:13:54,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:54,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:13:54,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:54,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:13:54,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:13:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:13:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:13:54,423 INFO L87 Difference]: Start difference. First operand 681 states and 822 transitions. Second operand 4 states. [2018-11-10 13:13:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:54,622 INFO L93 Difference]: Finished difference Result 1885 states and 2319 transitions. [2018-11-10 13:13:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:13:54,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-10 13:13:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:54,627 INFO L225 Difference]: With dead ends: 1885 [2018-11-10 13:13:54,627 INFO L226 Difference]: Without dead ends: 984 [2018-11-10 13:13:54,630 INFO L605 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-11-10 13:13:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-10 13:13:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 955. [2018-11-10 13:13:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-10 13:13:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1129 transitions. [2018-11-10 13:13:54,697 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1129 transitions. Word has length 127 [2018-11-10 13:13:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:54,697 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1129 transitions. [2018-11-10 13:13:54,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:13:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1129 transitions. [2018-11-10 13:13:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 13:13:54,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:54,701 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:54,702 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:54,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1155747963, now seen corresponding path program 1 times [2018-11-10 13:13:54,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:54,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:54,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:54,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-10 13:13:54,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:13:54,785 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:13:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:54,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:13:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 13:13:55,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:13:55,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-10 13:13:55,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:13:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:13:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:13:55,072 INFO L87 Difference]: Start difference. First operand 955 states and 1129 transitions. Second operand 12 states. [2018-11-10 13:13:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:55,193 INFO L93 Difference]: Finished difference Result 1847 states and 2207 transitions. [2018-11-10 13:13:55,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:13:55,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 267 [2018-11-10 13:13:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:55,197 INFO L225 Difference]: With dead ends: 1847 [2018-11-10 13:13:55,197 INFO L226 Difference]: Without dead ends: 913 [2018-11-10 13:13:55,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:13:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-11-10 13:13:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 865. [2018-11-10 13:13:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 13:13:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1007 transitions. [2018-11-10 13:13:55,267 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1007 transitions. Word has length 267 [2018-11-10 13:13:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:55,268 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1007 transitions. [2018-11-10 13:13:55,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:13:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1007 transitions. [2018-11-10 13:13:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 13:13:55,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:55,271 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:55,271 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:55,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:55,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2088222771, now seen corresponding path program 1 times [2018-11-10 13:13:55,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:55,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:55,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 13:13:55,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:55,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:13:55,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:13:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:13:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:13:55,375 INFO L87 Difference]: Start difference. First operand 865 states and 1007 transitions. Second operand 6 states. [2018-11-10 13:13:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:56,169 INFO L93 Difference]: Finished difference Result 2476 states and 2972 transitions. [2018-11-10 13:13:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:13:56,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-11-10 13:13:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:56,179 INFO L225 Difference]: With dead ends: 2476 [2018-11-10 13:13:56,179 INFO L226 Difference]: Without dead ends: 1667 [2018-11-10 13:13:56,182 INFO L605 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-11-10 13:13:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-11-10 13:13:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1513. [2018-11-10 13:13:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-11-10 13:13:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1788 transitions. [2018-11-10 13:13:56,317 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1788 transitions. Word has length 185 [2018-11-10 13:13:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:56,318 INFO L481 AbstractCegarLoop]: Abstraction has 1513 states and 1788 transitions. [2018-11-10 13:13:56,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:13:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1788 transitions. [2018-11-10 13:13:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 13:13:56,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:56,320 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:56,321 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:56,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash 667445621, now seen corresponding path program 1 times [2018-11-10 13:13:56,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:13:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 13:13:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:13:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:13:56,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:13:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:13:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:13:56,384 INFO L87 Difference]: Start difference. First operand 1513 states and 1788 transitions. Second operand 3 states. [2018-11-10 13:13:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:13:56,506 INFO L93 Difference]: Finished difference Result 2635 states and 3159 transitions. [2018-11-10 13:13:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:13:56,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-10 13:13:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:13:56,513 INFO L225 Difference]: With dead ends: 2635 [2018-11-10 13:13:56,513 INFO L226 Difference]: Without dead ends: 1521 [2018-11-10 13:13:56,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:13:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-11-10 13:13:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2018-11-10 13:13:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-11-10 13:13:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1799 transitions. [2018-11-10 13:13:56,638 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1799 transitions. Word has length 189 [2018-11-10 13:13:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:13:56,638 INFO L481 AbstractCegarLoop]: Abstraction has 1521 states and 1799 transitions. [2018-11-10 13:13:56,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:13:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1799 transitions. [2018-11-10 13:13:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 13:13:56,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:13:56,641 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:13:56,641 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:13:56,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:13:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 445162498, now seen corresponding path program 1 times [2018-11-10 13:13:56,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:13:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:13:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:13:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:13:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:13:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:13:56,710 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:13:56,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:13:56 BoogieIcfgContainer [2018-11-10 13:13:56,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:13:56,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:13:56,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:13:56,781 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:13:56,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:13:50" (3/4) ... [2018-11-10 13:13:56,784 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:13:56,868 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_afb77e9e-d5b2-4fc8-a3a7-4dd1eef5b6ac/bin-2019/uautomizer/witness.graphml [2018-11-10 13:13:56,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:13:56,869 INFO L168 Benchmark]: Toolchain (without parser) took 6819.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 397.9 MB). Free memory was 955.8 MB in the beginning and 1.2 GB in the end (delta: -261.3 MB). Peak memory consumption was 136.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,870 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:13:56,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.39 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 941.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,870 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,870 INFO L168 Benchmark]: RCFGBuilder took 373.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,871 INFO L168 Benchmark]: TraceAbstraction took 6113.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.0 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,871 INFO L168 Benchmark]: Witness Printer took 87.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:56,872 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.39 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 941.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.64 ms. Allocated memory is still 1.0 GB. Free memory was 941.0 MB in the beginning and 938.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6113.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.0 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. * Witness Printer took 87.15 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 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] RET 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] 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] RET 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] 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, RET !(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] 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] RET 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] 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] RET 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] 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, RET !(\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] 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, RET !(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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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] RET 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] 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, RET !(\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] 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] RET 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] 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] RET 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] 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, 155 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3196 SDtfs, 3334 SDslu, 4652 SDs, 0 SdLazy, 2588 SolverSat, 906 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 309 SyntacticMatches, 23 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1521occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 489 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2105 NumberOfCodeBlocks, 2105 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1899 ConstructedInterpolants, 0 QuantifiedInterpolants, 389766 SizeOfPredicates, 2 NumberOfNonLiveVariables, 947 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 768/794 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...