/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:48:30,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:48:30,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:48:30,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:48:30,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:48:30,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:48:30,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:48:30,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:48:30,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:48:30,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:48:30,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:48:30,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:48:30,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:48:30,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:48:30,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:48:30,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:48:30,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:48:30,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:48:30,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:48:30,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:48:30,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:48:30,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:48:30,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:48:30,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:48:30,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:48:30,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:48:30,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:48:30,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:48:30,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:48:30,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:48:30,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:48:30,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:48:30,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:48:30,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:48:30,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:48:30,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:48:30,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:48:30,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:48:30,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:48:30,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:48:30,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:48:30,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:48:30,690 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:48:30,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:48:30,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:48:30,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:48:30,693 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:48:30,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:48:30,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:48:30,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:48:30,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:48:30,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:48:30,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:48:30,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:48:30,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:48:30,696 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:48:30,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:48:30,697 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:48:30,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:48:30,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:48:30,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:48:30,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:48:30,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:48:30,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:48:30,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:48:30,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:48:30,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:48:30,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:48:30,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:48:30,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:48:30,699 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:48:30,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:48:31,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:48:31,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:48:31,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:48:31,174 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:48:31,174 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:48:31,177 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-09-04 13:48:31,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b171f524/a79c0cc0ea5541c593b20564aa32702d/FLAG2ed0a9897 [2020-09-04 13:48:31,864 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:48:31,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-09-04 13:48:31,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b171f524/a79c0cc0ea5541c593b20564aa32702d/FLAG2ed0a9897 [2020-09-04 13:48:32,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5b171f524/a79c0cc0ea5541c593b20564aa32702d [2020-09-04 13:48:32,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:48:32,159 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:48:32,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:48:32,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:48:32,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:48:32,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19617743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32, skipping insertion in model container [2020-09-04 13:48:32,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:48:32,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:48:32,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:48:32,514 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:48:32,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:48:32,700 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:48:32,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32 WrapperNode [2020-09-04 13:48:32,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:48:32,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:48:32,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:48:32,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:48:32,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... [2020-09-04 13:48:32,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:48:32,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:48:32,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:48:32,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:48:32,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/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 [2020-09-04 13:48:32,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:48:32,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:48:32,851 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 13:48:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-09-04 13:48:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 13:48:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:48:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:48:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:48:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 13:48:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 13:48:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 13:48:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 13:48:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 13:48:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 13:48:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:48:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:48:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:48:32,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-09-04 13:48:32,856 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:48:32,857 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:48:32,858 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:48:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:48:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:48:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:48:32,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:48:33,493 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:48:33,493 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-09-04 13:48:33,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:48:33 BoogieIcfgContainer [2020-09-04 13:48:33,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:48:33,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:48:33,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:48:33,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:48:33,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:48:32" (1/3) ... [2020-09-04 13:48:33,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a615fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:48:33, skipping insertion in model container [2020-09-04 13:48:33,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:48:32" (2/3) ... [2020-09-04 13:48:33,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a615fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:48:33, skipping insertion in model container [2020-09-04 13:48:33,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:48:33" (3/3) ... [2020-09-04 13:48:33,519 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-09-04 13:48:33,533 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:48:33,550 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:48:33,574 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:48:33,612 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:48:33,612 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:48:33,612 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:48:33,613 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:48:33,613 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:48:33,613 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:48:33,613 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:48:33,614 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:48:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-09-04 13:48:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:33,658 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:33,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:33,660 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-09-04 13:48:33,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:33,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72859931] [2020-09-04 13:48:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:34,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72859931] [2020-09-04 13:48:34,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:34,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:48:34,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299331775] [2020-09-04 13:48:34,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:48:34,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:48:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:48:34,535 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 14 states. [2020-09-04 13:48:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:37,916 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2020-09-04 13:48:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:48:37,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2020-09-04 13:48:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:37,940 INFO L225 Difference]: With dead ends: 449 [2020-09-04 13:48:37,940 INFO L226 Difference]: Without dead ends: 276 [2020-09-04 13:48:37,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:48:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-09-04 13:48:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-09-04 13:48:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-09-04 13:48:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2020-09-04 13:48:38,047 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 92 [2020-09-04 13:48:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:38,048 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2020-09-04 13:48:38,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:48:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2020-09-04 13:48:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:38,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:38,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:38,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:48:38,055 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2098275908, now seen corresponding path program 1 times [2020-09-04 13:48:38,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:38,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761685658] [2020-09-04 13:48:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:38,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761685658] [2020-09-04 13:48:38,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:38,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:38,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260898711] [2020-09-04 13:48:38,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:38,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:38,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:38,363 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 10 states. [2020-09-04 13:48:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:40,117 INFO L93 Difference]: Finished difference Result 425 states and 610 transitions. [2020-09-04 13:48:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:48:40,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:40,122 INFO L225 Difference]: With dead ends: 425 [2020-09-04 13:48:40,123 INFO L226 Difference]: Without dead ends: 268 [2020-09-04 13:48:40,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:48:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-09-04 13:48:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2020-09-04 13:48:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-09-04 13:48:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2020-09-04 13:48:40,169 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2020-09-04 13:48:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:40,170 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2020-09-04 13:48:40,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2020-09-04 13:48:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:40,185 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:40,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:40,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:48:40,187 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1653808840, now seen corresponding path program 1 times [2020-09-04 13:48:40,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:40,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876326863] [2020-09-04 13:48:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:40,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876326863] [2020-09-04 13:48:40,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:40,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803387095] [2020-09-04 13:48:40,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:40,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:40,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:40,534 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 10 states. [2020-09-04 13:48:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:42,834 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2020-09-04 13:48:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:48:42,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:42,840 INFO L225 Difference]: With dead ends: 504 [2020-09-04 13:48:42,841 INFO L226 Difference]: Without dead ends: 347 [2020-09-04 13:48:42,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:48:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-09-04 13:48:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2020-09-04 13:48:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 13:48:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2020-09-04 13:48:42,882 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 92 [2020-09-04 13:48:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:42,883 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2020-09-04 13:48:42,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2020-09-04 13:48:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:42,885 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:42,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:42,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:48:42,886 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2020-09-04 13:48:42,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:42,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123171557] [2020-09-04 13:48:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:42,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:43,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123171557] [2020-09-04 13:48:43,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:43,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:43,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452632885] [2020-09-04 13:48:43,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:43,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:43,163 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 10 states. [2020-09-04 13:48:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:45,523 INFO L93 Difference]: Finished difference Result 586 states and 840 transitions. [2020-09-04 13:48:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:48:45,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:45,530 INFO L225 Difference]: With dead ends: 586 [2020-09-04 13:48:45,530 INFO L226 Difference]: Without dead ends: 393 [2020-09-04 13:48:45,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:48:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-09-04 13:48:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 249. [2020-09-04 13:48:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-09-04 13:48:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2020-09-04 13:48:45,611 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 92 [2020-09-04 13:48:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:45,611 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2020-09-04 13:48:45,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2020-09-04 13:48:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:45,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:45,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:45,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:48:45,617 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2020-09-04 13:48:45,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:45,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293163323] [2020-09-04 13:48:45,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:45,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293163323] [2020-09-04 13:48:45,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:45,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:45,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206767074] [2020-09-04 13:48:45,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:45,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:45,850 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand 10 states. [2020-09-04 13:48:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:48,198 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2020-09-04 13:48:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:48:48,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:48,203 INFO L225 Difference]: With dead ends: 663 [2020-09-04 13:48:48,203 INFO L226 Difference]: Without dead ends: 434 [2020-09-04 13:48:48,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:48:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-09-04 13:48:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2020-09-04 13:48:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-09-04 13:48:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2020-09-04 13:48:48,240 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 92 [2020-09-04 13:48:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:48,240 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2020-09-04 13:48:48,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2020-09-04 13:48:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:48,242 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:48,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:48,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:48:48,242 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:48,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2020-09-04 13:48:48,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:48,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156374684] [2020-09-04 13:48:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:48,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156374684] [2020-09-04 13:48:48,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:48,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:48,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975997926] [2020-09-04 13:48:48,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:48,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:48,517 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 10 states. [2020-09-04 13:48:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:50,717 INFO L93 Difference]: Finished difference Result 674 states and 877 transitions. [2020-09-04 13:48:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:48:50,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:50,722 INFO L225 Difference]: With dead ends: 674 [2020-09-04 13:48:50,722 INFO L226 Difference]: Without dead ends: 413 [2020-09-04 13:48:50,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:48:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-09-04 13:48:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 287. [2020-09-04 13:48:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-09-04 13:48:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 347 transitions. [2020-09-04 13:48:50,755 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 347 transitions. Word has length 92 [2020-09-04 13:48:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:50,756 INFO L479 AbstractCegarLoop]: Abstraction has 287 states and 347 transitions. [2020-09-04 13:48:50,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 347 transitions. [2020-09-04 13:48:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:50,757 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:50,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:50,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:48:50,758 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2020-09-04 13:48:50,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:50,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010554205] [2020-09-04 13:48:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:50,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:51,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:51,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010554205] [2020-09-04 13:48:51,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:51,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:51,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136585737] [2020-09-04 13:48:51,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:51,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:51,022 INFO L87 Difference]: Start difference. First operand 287 states and 347 transitions. Second operand 10 states. [2020-09-04 13:48:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:53,858 INFO L93 Difference]: Finished difference Result 1068 states and 1350 transitions. [2020-09-04 13:48:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:48:53,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-09-04 13:48:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:53,871 INFO L225 Difference]: With dead ends: 1068 [2020-09-04 13:48:53,872 INFO L226 Difference]: Without dead ends: 801 [2020-09-04 13:48:53,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-09-04 13:48:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-09-04 13:48:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 591. [2020-09-04 13:48:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-04 13:48:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2020-09-04 13:48:54,008 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 92 [2020-09-04 13:48:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:54,009 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2020-09-04 13:48:54,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2020-09-04 13:48:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 13:48:54,011 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:54,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:54,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:48:54,012 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2020-09-04 13:48:54,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:54,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617555094] [2020-09-04 13:48:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:54,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617555094] [2020-09-04 13:48:54,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:54,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:48:54,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959442437] [2020-09-04 13:48:54,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:48:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:48:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:48:54,217 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 7 states. [2020-09-04 13:48:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:56,426 INFO L93 Difference]: Finished difference Result 2051 states and 2640 transitions. [2020-09-04 13:48:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:48:56,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-09-04 13:48:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:56,437 INFO L225 Difference]: With dead ends: 2051 [2020-09-04 13:48:56,437 INFO L226 Difference]: Without dead ends: 1481 [2020-09-04 13:48:56,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:48:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-09-04 13:48:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1207. [2020-09-04 13:48:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-09-04 13:48:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1495 transitions. [2020-09-04 13:48:56,570 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1495 transitions. Word has length 92 [2020-09-04 13:48:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:56,570 INFO L479 AbstractCegarLoop]: Abstraction has 1207 states and 1495 transitions. [2020-09-04 13:48:56,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:48:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1495 transitions. [2020-09-04 13:48:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-09-04 13:48:56,574 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:56,574 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:56,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:48:56,575 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2020-09-04 13:48:56,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:56,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771016033] [2020-09-04 13:48:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:48:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:48:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:48:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 13:48:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:48:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:48:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-09-04 13:48:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-09-04 13:48:56,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771016033] [2020-09-04 13:48:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:48:56,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375225298] [2020-09-04 13:48:56,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:48:56,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:48:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:56,881 INFO L87 Difference]: Start difference. First operand 1207 states and 1495 transitions. Second operand 9 states. [2020-09-04 13:49:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:00,225 INFO L93 Difference]: Finished difference Result 3860 states and 4987 transitions. [2020-09-04 13:49:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:49:00,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2020-09-04 13:49:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:00,243 INFO L225 Difference]: With dead ends: 3860 [2020-09-04 13:49:00,244 INFO L226 Difference]: Without dead ends: 2675 [2020-09-04 13:49:00,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:49:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2020-09-04 13:49:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2303. [2020-09-04 13:49:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2020-09-04 13:49:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2940 transitions. [2020-09-04 13:49:00,496 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2940 transitions. Word has length 147 [2020-09-04 13:49:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:00,498 INFO L479 AbstractCegarLoop]: Abstraction has 2303 states and 2940 transitions. [2020-09-04 13:49:00,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:49:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2940 transitions. [2020-09-04 13:49:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-09-04 13:49:00,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:00,508 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:00,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:49:00,508 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1620831515, now seen corresponding path program 1 times [2020-09-04 13:49:00,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:00,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504751778] [2020-09-04 13:49:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-09-04 13:49:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-09-04 13:49:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 13:49:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:00,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2020-09-04 13:49:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-09-04 13:49:01,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504751778] [2020-09-04 13:49:01,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:01,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:49:01,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381551778] [2020-09-04 13:49:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:49:01,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:49:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:49:01,009 INFO L87 Difference]: Start difference. First operand 2303 states and 2940 transitions. Second operand 11 states. [2020-09-04 13:49:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:02,941 INFO L93 Difference]: Finished difference Result 4832 states and 6206 transitions. [2020-09-04 13:49:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:49:02,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 248 [2020-09-04 13:49:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:02,957 INFO L225 Difference]: With dead ends: 4832 [2020-09-04 13:49:02,957 INFO L226 Difference]: Without dead ends: 2550 [2020-09-04 13:49:02,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:49:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2020-09-04 13:49:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2296. [2020-09-04 13:49:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2020-09-04 13:49:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 2926 transitions. [2020-09-04 13:49:03,241 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 2926 transitions. Word has length 248 [2020-09-04 13:49:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:03,241 INFO L479 AbstractCegarLoop]: Abstraction has 2296 states and 2926 transitions. [2020-09-04 13:49:03,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:49:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2926 transitions. [2020-09-04 13:49:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-09-04 13:49:03,247 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:03,247 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-04 13:49:03,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:49:03,248 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2020-09-04 13:49:03,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:03,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171791388] [2020-09-04 13:49:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 13:49:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-09-04 13:49:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-09-04 13:49:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-09-04 13:49:03,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171791388] [2020-09-04 13:49:03,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:03,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:03,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236881330] [2020-09-04 13:49:03,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:03,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:03,801 INFO L87 Difference]: Start difference. First operand 2296 states and 2926 transitions. Second operand 10 states. [2020-09-04 13:49:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:06,892 INFO L93 Difference]: Finished difference Result 6861 states and 9505 transitions. [2020-09-04 13:49:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:49:06,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-09-04 13:49:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:06,927 INFO L225 Difference]: With dead ends: 6861 [2020-09-04 13:49:06,928 INFO L226 Difference]: Without dead ends: 4586 [2020-09-04 13:49:06,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:49:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2020-09-04 13:49:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4198. [2020-09-04 13:49:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2020-09-04 13:49:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5326 transitions. [2020-09-04 13:49:07,448 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5326 transitions. Word has length 191 [2020-09-04 13:49:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:07,449 INFO L479 AbstractCegarLoop]: Abstraction has 4198 states and 5326 transitions. [2020-09-04 13:49:07,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5326 transitions. [2020-09-04 13:49:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-04 13:49:07,455 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:07,456 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 13:49:07,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:49:07,456 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:07,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2020-09-04 13:49:07,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:07,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997114164] [2020-09-04 13:49:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 13:49:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 13:49:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-09-04 13:49:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-09-04 13:49:07,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997114164] [2020-09-04 13:49:07,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732833015] [2020-09-04 13:49:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:08,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:49:08,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 13:49:08,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:08,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2020-09-04 13:49:08,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306055001] [2020-09-04 13:49:08,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:08,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:49:08,132 INFO L87 Difference]: Start difference. First operand 4198 states and 5326 transitions. Second operand 3 states. [2020-09-04 13:49:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:08,975 INFO L93 Difference]: Finished difference Result 11573 states and 15836 transitions. [2020-09-04 13:49:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:08,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2020-09-04 13:49:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:09,025 INFO L225 Difference]: With dead ends: 11573 [2020-09-04 13:49:09,025 INFO L226 Difference]: Without dead ends: 7397 [2020-09-04 13:49:09,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:49:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2020-09-04 13:49:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 7377. [2020-09-04 13:49:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2020-09-04 13:49:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9620 transitions. [2020-09-04 13:49:09,816 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9620 transitions. Word has length 192 [2020-09-04 13:49:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:09,817 INFO L479 AbstractCegarLoop]: Abstraction has 7377 states and 9620 transitions. [2020-09-04 13:49:09,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9620 transitions. [2020-09-04 13:49:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-09-04 13:49:09,828 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:09,828 INFO L422 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, 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] [2020-09-04 13:49:10,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-09-04 13:49:10,041 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1391086419, now seen corresponding path program 1 times [2020-09-04 13:49:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:10,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359729675] [2020-09-04 13:49:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-09-04 13:49:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-09-04 13:49:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 13:49:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-09-04 13:49:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-09-04 13:49:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-09-04 13:49:10,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359729675] [2020-09-04 13:49:10,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276211408] [2020-09-04 13:49:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:10,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:49:10,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-09-04 13:49:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-09-04 13:49:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315589026] [2020-09-04 13:49:10,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:10,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:49:10,816 INFO L87 Difference]: Start difference. First operand 7377 states and 9620 transitions. Second operand 3 states. [2020-09-04 13:49:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:11,657 INFO L93 Difference]: Finished difference Result 11477 states and 14788 transitions. [2020-09-04 13:49:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:11,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-09-04 13:49:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:11,713 INFO L225 Difference]: With dead ends: 11477 [2020-09-04 13:49:11,713 INFO L226 Difference]: Without dead ends: 7380 [2020-09-04 13:49:11,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:49:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2020-09-04 13:49:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 7376. [2020-09-04 13:49:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7376 states. [2020-09-04 13:49:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 9240 transitions. [2020-09-04 13:49:12,742 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 9240 transitions. Word has length 194 [2020-09-04 13:49:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:12,743 INFO L479 AbstractCegarLoop]: Abstraction has 7376 states and 9240 transitions. [2020-09-04 13:49:12,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 9240 transitions. [2020-09-04 13:49:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2020-09-04 13:49:12,756 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:12,757 INFO L422 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:12,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-09-04 13:49:12,972 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash -204454725, now seen corresponding path program 1 times [2020-09-04 13:49:12,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:12,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810468263] [2020-09-04 13:49:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:49:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:49:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 13:49:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:49:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-09-04 13:49:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 13:49:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-09-04 13:49:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 13:49:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-09-04 13:49:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 13:49:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-09-04 13:49:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-09-04 13:49:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2020-09-04 13:49:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2020-09-04 13:49:13,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810468263] [2020-09-04 13:49:13,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062954451] [2020-09-04 13:49:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:13,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:49:13,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-09-04 13:49:13,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:13,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:49:13,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106481840] [2020-09-04 13:49:13,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:13,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:13,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:13,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:13,681 INFO L87 Difference]: Start difference. First operand 7376 states and 9240 transitions. Second operand 3 states. [2020-09-04 13:49:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:14,771 INFO L93 Difference]: Finished difference Result 15122 states and 19239 transitions. [2020-09-04 13:49:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:14,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2020-09-04 13:49:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:14,825 INFO L225 Difference]: With dead ends: 15122 [2020-09-04 13:49:14,825 INFO L226 Difference]: Without dead ends: 7768 [2020-09-04 13:49:14,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2020-09-04 13:49:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7344. [2020-09-04 13:49:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7344 states. [2020-09-04 13:49:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7344 states to 7344 states and 9124 transitions. [2020-09-04 13:49:16,453 INFO L78 Accepts]: Start accepts. Automaton has 7344 states and 9124 transitions. Word has length 305 [2020-09-04 13:49:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:16,454 INFO L479 AbstractCegarLoop]: Abstraction has 7344 states and 9124 transitions. [2020-09-04 13:49:16,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7344 states and 9124 transitions. [2020-09-04 13:49:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-09-04 13:49:16,466 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:16,467 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-04 13:49:16,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-09-04 13:49:16,681 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1451826661, now seen corresponding path program 1 times [2020-09-04 13:49:16,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:16,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207851740] [2020-09-04 13:49:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 13:49:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:16,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-09-04 13:49:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 13:49:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-09-04 13:49:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-09-04 13:49:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-09-04 13:49:17,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207851740] [2020-09-04 13:49:17,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862958718] [2020-09-04 13:49:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:17,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:49:17,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 13:49:17,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:17,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-09-04 13:49:17,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678585799] [2020-09-04 13:49:17,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:17,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:17,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:49:17,304 INFO L87 Difference]: Start difference. First operand 7344 states and 9124 transitions. Second operand 3 states. [2020-09-04 13:49:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:18,290 INFO L93 Difference]: Finished difference Result 20797 states and 27002 transitions. [2020-09-04 13:49:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:18,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-09-04 13:49:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:18,361 INFO L225 Difference]: With dead ends: 20797 [2020-09-04 13:49:18,361 INFO L226 Difference]: Without dead ends: 13475 [2020-09-04 13:49:18,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:49:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13475 states. [2020-09-04 13:49:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13475 to 13471. [2020-09-04 13:49:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13471 states. [2020-09-04 13:49:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13471 states to 13471 states and 17180 transitions. [2020-09-04 13:49:19,723 INFO L78 Accepts]: Start accepts. Automaton has 13471 states and 17180 transitions. Word has length 212 [2020-09-04 13:49:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:19,724 INFO L479 AbstractCegarLoop]: Abstraction has 13471 states and 17180 transitions. [2020-09-04 13:49:19,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13471 states and 17180 transitions. [2020-09-04 13:49:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 13:49:19,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:19,744 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:19,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:19,959 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1721244321, now seen corresponding path program 1 times [2020-09-04 13:49:19,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:19,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797126449] [2020-09-04 13:49:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 13:49:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-09-04 13:49:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 13:49:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 13:49:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 13:49:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-09-04 13:49:20,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797126449] [2020-09-04 13:49:20,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504216412] [2020-09-04 13:49:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:20,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:49:20,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-09-04 13:49:20,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:20,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:49:20,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872403235] [2020-09-04 13:49:20,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:20,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:20,462 INFO L87 Difference]: Start difference. First operand 13471 states and 17180 transitions. Second operand 3 states. [2020-09-04 13:49:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:22,039 INFO L93 Difference]: Finished difference Result 38096 states and 50139 transitions. [2020-09-04 13:49:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:22,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-09-04 13:49:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:22,154 INFO L225 Difference]: With dead ends: 38096 [2020-09-04 13:49:22,154 INFO L226 Difference]: Without dead ends: 24652 [2020-09-04 13:49:22,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24652 states. [2020-09-04 13:49:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24652 to 24648. [2020-09-04 13:49:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24648 states. [2020-09-04 13:49:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24648 states to 24648 states and 30999 transitions. [2020-09-04 13:49:24,120 INFO L78 Accepts]: Start accepts. Automaton has 24648 states and 30999 transitions. Word has length 213 [2020-09-04 13:49:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:24,121 INFO L479 AbstractCegarLoop]: Abstraction has 24648 states and 30999 transitions. [2020-09-04 13:49:24,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 24648 states and 30999 transitions. [2020-09-04 13:49:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 13:49:24,146 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:24,146 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-04 13:49:24,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-09-04 13:49:24,347 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1479206909, now seen corresponding path program 1 times [2020-09-04 13:49:24,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:24,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109989966] [2020-09-04 13:49:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:49:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 13:49:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 13:49:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-09-04 13:49:24,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109989966] [2020-09-04 13:49:24,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:24,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:24,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122005095] [2020-09-04 13:49:24,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:24,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:24,657 INFO L87 Difference]: Start difference. First operand 24648 states and 30999 transitions. Second operand 10 states. [2020-09-04 13:49:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:27,990 INFO L93 Difference]: Finished difference Result 44970 states and 56786 transitions. [2020-09-04 13:49:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:49:27,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-09-04 13:49:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:28,082 INFO L225 Difference]: With dead ends: 44970 [2020-09-04 13:49:28,083 INFO L226 Difference]: Without dead ends: 20348 [2020-09-04 13:49:28,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:49:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20348 states. [2020-09-04 13:49:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20348 to 19590. [2020-09-04 13:49:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19590 states. [2020-09-04 13:49:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19590 states to 19590 states and 24537 transitions. [2020-09-04 13:49:29,632 INFO L78 Accepts]: Start accepts. Automaton has 19590 states and 24537 transitions. Word has length 213 [2020-09-04 13:49:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:29,633 INFO L479 AbstractCegarLoop]: Abstraction has 19590 states and 24537 transitions. [2020-09-04 13:49:29,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19590 states and 24537 transitions. [2020-09-04 13:49:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 13:49:29,651 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:29,651 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:29,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:49:29,651 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash 352584377, now seen corresponding path program 1 times [2020-09-04 13:49:29,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:29,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268929668] [2020-09-04 13:49:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:49:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 13:49:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:29,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:30,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:30,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 13:49:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-09-04 13:49:30,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268929668] [2020-09-04 13:49:30,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:30,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:49:30,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743129746] [2020-09-04 13:49:30,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:49:30,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:49:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:49:30,051 INFO L87 Difference]: Start difference. First operand 19590 states and 24537 transitions. Second operand 12 states. [2020-09-04 13:49:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:35,010 INFO L93 Difference]: Finished difference Result 36709 states and 47342 transitions. [2020-09-04 13:49:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:49:35,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 213 [2020-09-04 13:49:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:35,099 INFO L225 Difference]: With dead ends: 36709 [2020-09-04 13:49:35,100 INFO L226 Difference]: Without dead ends: 13077 [2020-09-04 13:49:35,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:49:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2020-09-04 13:49:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 12641. [2020-09-04 13:49:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12641 states. [2020-09-04 13:49:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12641 states to 12641 states and 14974 transitions. [2020-09-04 13:49:37,194 INFO L78 Accepts]: Start accepts. Automaton has 12641 states and 14974 transitions. Word has length 213 [2020-09-04 13:49:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:37,194 INFO L479 AbstractCegarLoop]: Abstraction has 12641 states and 14974 transitions. [2020-09-04 13:49:37,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:49:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12641 states and 14974 transitions. [2020-09-04 13:49:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 13:49:37,201 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:37,201 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:37,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:49:37,201 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 1 times [2020-09-04 13:49:37,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:37,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384748532] [2020-09-04 13:49:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 13:49:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:49:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 13:49:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 13:49:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 13:49:37,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384748532] [2020-09-04 13:49:37,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218256987] [2020-09-04 13:49:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:37,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 27 conjunts are in the unsatisfiable core [2020-09-04 13:49:37,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-09-04 13:49:37,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:37,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2020-09-04 13:49:37,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179298354] [2020-09-04 13:49:37,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:49:37,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:49:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:49:37,863 INFO L87 Difference]: Start difference. First operand 12641 states and 14974 transitions. Second operand 4 states. [2020-09-04 13:49:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:39,342 INFO L93 Difference]: Finished difference Result 22854 states and 28308 transitions. [2020-09-04 13:49:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:49:39,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-09-04 13:49:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:39,396 INFO L225 Difference]: With dead ends: 22854 [2020-09-04 13:49:39,396 INFO L226 Difference]: Without dead ends: 13172 [2020-09-04 13:49:39,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:49:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13172 states. [2020-09-04 13:49:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13172 to 12895. [2020-09-04 13:49:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12895 states. [2020-09-04 13:49:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12895 states to 12895 states and 15306 transitions. [2020-09-04 13:49:40,416 INFO L78 Accepts]: Start accepts. Automaton has 12895 states and 15306 transitions. Word has length 213 [2020-09-04 13:49:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:40,417 INFO L479 AbstractCegarLoop]: Abstraction has 12895 states and 15306 transitions. [2020-09-04 13:49:40,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:49:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 12895 states and 15306 transitions. [2020-09-04 13:49:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 13:49:40,425 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:40,426 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:40,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:40,634 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 407200168, now seen corresponding path program 1 times [2020-09-04 13:49:40,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:40,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139708942] [2020-09-04 13:49:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-09-04 13:49:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:49:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 13:49:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 13:49:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-09-04 13:49:40,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139708942] [2020-09-04 13:49:40,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:49:40,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:49:40,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855187443] [2020-09-04 13:49:40,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:49:40,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:49:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:40,920 INFO L87 Difference]: Start difference. First operand 12895 states and 15306 transitions. Second operand 10 states. [2020-09-04 13:49:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:43,356 INFO L93 Difference]: Finished difference Result 13257 states and 15941 transitions. [2020-09-04 13:49:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:49:43,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-09-04 13:49:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:43,388 INFO L225 Difference]: With dead ends: 13257 [2020-09-04 13:49:43,389 INFO L226 Difference]: Without dead ends: 10316 [2020-09-04 13:49:43,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:49:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10316 states. [2020-09-04 13:49:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10316 to 9958. [2020-09-04 13:49:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9958 states. [2020-09-04 13:49:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 11944 transitions. [2020-09-04 13:49:44,225 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 11944 transitions. Word has length 213 [2020-09-04 13:49:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:44,226 INFO L479 AbstractCegarLoop]: Abstraction has 9958 states and 11944 transitions. [2020-09-04 13:49:44,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:49:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 11944 transitions. [2020-09-04 13:49:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-04 13:49:44,230 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:44,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:44,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:49:44,231 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-09-04 13:49:44,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:44,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666585459] [2020-09-04 13:49:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-09-04 13:49:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-09-04 13:49:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:49:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 13:49:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-09-04 13:49:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 13:49:44,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666585459] [2020-09-04 13:49:44,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034172305] [2020-09-04 13:49:44,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:44,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-04 13:49:44,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-09-04 13:49:44,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:44,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2020-09-04 13:49:44,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378500244] [2020-09-04 13:49:44,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:49:44,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:49:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:49:44,843 INFO L87 Difference]: Start difference. First operand 9958 states and 11944 transitions. Second operand 6 states. [2020-09-04 13:49:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:45,459 INFO L93 Difference]: Finished difference Result 14436 states and 17381 transitions. [2020-09-04 13:49:45,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:49:45,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-09-04 13:49:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:45,471 INFO L225 Difference]: With dead ends: 14436 [2020-09-04 13:49:45,471 INFO L226 Difference]: Without dead ends: 2747 [2020-09-04 13:49:45,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:49:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2020-09-04 13:49:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2741. [2020-09-04 13:49:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-09-04 13:49:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 3064 transitions. [2020-09-04 13:49:45,958 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 3064 transitions. Word has length 215 [2020-09-04 13:49:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:45,959 INFO L479 AbstractCegarLoop]: Abstraction has 2741 states and 3064 transitions. [2020-09-04 13:49:45,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:49:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 3064 transitions. [2020-09-04 13:49:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2020-09-04 13:49:45,966 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:45,967 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:46,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:46,181 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2084163587, now seen corresponding path program 1 times [2020-09-04 13:49:46,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:46,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843195770] [2020-09-04 13:49:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:49:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:49:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 13:49:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:49:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-09-04 13:49:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 13:49:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-09-04 13:49:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-09-04 13:49:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-09-04 13:49:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-09-04 13:49:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 13:49:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-09-04 13:49:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-09-04 13:49:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-09-04 13:49:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2020-09-04 13:49:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-09-04 13:49:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2020-09-04 13:49:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2020-09-04 13:49:46,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843195770] [2020-09-04 13:49:46,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021511391] [2020-09-04 13:49:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 5 conjunts are in the unsatisfiable core [2020-09-04 13:49:47,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-09-04 13:49:47,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:47,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 14 [2020-09-04 13:49:47,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927260254] [2020-09-04 13:49:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:49:47,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:49:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:49:47,131 INFO L87 Difference]: Start difference. First operand 2741 states and 3064 transitions. Second operand 6 states. [2020-09-04 13:49:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:47,262 INFO L93 Difference]: Finished difference Result 3716 states and 4180 transitions. [2020-09-04 13:49:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:49:47,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 373 [2020-09-04 13:49:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:47,266 INFO L225 Difference]: With dead ends: 3716 [2020-09-04 13:49:47,266 INFO L226 Difference]: Without dead ends: 997 [2020-09-04 13:49:47,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:49:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-09-04 13:49:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 916. [2020-09-04 13:49:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2020-09-04 13:49:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2020-09-04 13:49:47,327 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 373 [2020-09-04 13:49:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:47,327 INFO L479 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2020-09-04 13:49:47,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:49:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2020-09-04 13:49:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-09-04 13:49:47,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:47,330 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:47,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-09-04 13:49:47,545 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-09-04 13:49:47,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:47,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272407129] [2020-09-04 13:49:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 13:49:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 13:49:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:47,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-09-04 13:49:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 13:49:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-09-04 13:49:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-09-04 13:49:48,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272407129] [2020-09-04 13:49:48,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985375395] [2020-09-04 13:49:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:48,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-09-04 13:49:48,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-09-04 13:49:48,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:49:48,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-09-04 13:49:48,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478716153] [2020-09-04 13:49:48,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:49:48,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:49:48,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:49:48,543 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 14 states. [2020-09-04 13:49:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:51,601 INFO L93 Difference]: Finished difference Result 952 states and 1040 transitions. [2020-09-04 13:49:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 13:49:51,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2020-09-04 13:49:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:51,604 INFO L225 Difference]: With dead ends: 952 [2020-09-04 13:49:51,605 INFO L226 Difference]: Without dead ends: 949 [2020-09-04 13:49:51,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 335 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:49:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-09-04 13:49:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 915. [2020-09-04 13:49:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-09-04 13:49:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 989 transitions. [2020-09-04 13:49:51,730 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 989 transitions. Word has length 267 [2020-09-04 13:49:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:51,731 INFO L479 AbstractCegarLoop]: Abstraction has 915 states and 989 transitions. [2020-09-04 13:49:51,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:49:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 989 transitions. [2020-09-04 13:49:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-09-04 13:49:51,733 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:51,734 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:51,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:51,949 INFO L427 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-09-04 13:49:51,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:51,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608972252] [2020-09-04 13:49:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:49:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:49:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:49:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:49:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:49:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 13:49:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-04 13:49:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:49:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 13:49:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 13:49:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 13:49:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:49:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-09-04 13:49:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:49:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:49:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 13:49:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:49:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:49:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:49:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:49:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:49:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-09-04 13:49:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-09-04 13:49:52,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608972252] [2020-09-04 13:49:52,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002367015] [2020-09-04 13:49:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:49:52,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:49:52,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:49:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-09-04 13:49:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:49:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:49:52,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903641525] [2020-09-04 13:49:52,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:49:52,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:49:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:49:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:52,547 INFO L87 Difference]: Start difference. First operand 915 states and 989 transitions. Second operand 3 states. [2020-09-04 13:49:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:49:52,649 INFO L93 Difference]: Finished difference Result 1617 states and 1757 transitions. [2020-09-04 13:49:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:49:52,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-09-04 13:49:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:49:52,652 INFO L225 Difference]: With dead ends: 1617 [2020-09-04 13:49:52,652 INFO L226 Difference]: Without dead ends: 929 [2020-09-04 13:49:52,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:49:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-09-04 13:49:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2020-09-04 13:49:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-09-04 13:49:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 999 transitions. [2020-09-04 13:49:52,722 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 999 transitions. Word has length 271 [2020-09-04 13:49:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:49:52,723 INFO L479 AbstractCegarLoop]: Abstraction has 923 states and 999 transitions. [2020-09-04 13:49:52,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:49:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 999 transitions. [2020-09-04 13:49:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-09-04 13:49:52,724 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:49:52,725 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:49:52,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:49:52,926 INFO L427 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:49:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:49:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-09-04 13:49:52,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:49:52,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659461828] [2020-09-04 13:49:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:49:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:49:52,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:49:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:49:53,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:49:53,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:49:53,149 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:49:53,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:49:53,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:49:53 BoogieIcfgContainer [2020-09-04 13:49:53,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:49:53,382 INFO L168 Benchmark]: Toolchain (without parser) took 81222.63 ms. Allocated memory was 140.0 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 103.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 681.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:53,383 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:49:53,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.47 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 180.4 MB in the end (delta: -77.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:53,384 INFO L168 Benchmark]: Boogie Preprocessor took 62.92 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:53,384 INFO L168 Benchmark]: RCFGBuilder took 738.73 ms. Allocated memory is still 203.9 MB. Free memory was 177.8 MB in the beginning and 138.4 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:53,385 INFO L168 Benchmark]: TraceAbstraction took 79870.76 ms. Allocated memory was 203.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 653.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:53,387 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.73 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 540.47 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 180.4 MB in the end (delta: -77.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.92 ms. Allocated memory is still 203.9 MB. Free memory was 180.4 MB in the beginning and 177.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 738.73 ms. Allocated memory is still 203.9 MB. Free memory was 177.8 MB in the beginning and 138.4 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79870.76 ms. Allocated memory was 203.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 653.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-2, tmp_ndt_3=1, token=-1] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=-1] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L115] token += 1 [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L117] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L151] token += 1 [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 181 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 79.5s, OverallIterations: 25, TraceHistogramMax: 7, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5264 SDtfs, 13360 SDslu, 3811 SDs, 0 SdLazy, 17936 SolverSat, 5776 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3924 GetRequests, 3548 SyntacticMatches, 7 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24648occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 4656 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 7143 NumberOfCodeBlocks, 7143 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6837 ConstructedInterpolants, 0 QuantifiedInterpolants, 2984336 SizeOfPredicates, 13 NumberOfNonLiveVariables, 10225 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 4748/4907 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...